A basic problem in the design of mobile telephone networks is to assign sets of radio frequency bands (colours) to transmitters (vertices) to avoid interference. Often the transmi...
We investigate the minimum and maximum number of colors in edge-colorings of Kn,n such that every copy of Kp,p receives at least q and at most q colors. Along the way we improve t...
Some recent results provide su cient conditions for complete lattices of closure operators on complete lattices, ordered pointwise, to be pseudocomplemented. This paper gives resu...
Abstract. A k-sized balanced sampling plan excluding contiguous units of order v and index , denoted by BSEC(v, k, ), is said to be bicyclic if it admits an automorphism consisting...
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are tre...