Sciweavers

547 search results - page 57 / 110
» dm 2008
Sort
View
111
Voted
DM
2002
82views more  DM 2002»
15 years 20 days ago
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
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...
Frédéric Havet, Janez Zerovnik
83
Voted
DM
2002
81views more  DM 2002»
15 years 20 days ago
On restricted edge-colorings of bicliques
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...
Dhruv Mubayi, Douglas B. West
DM
2002
101views more  DM 2002»
15 years 20 days ago
Pseudocomplements of closure operators on posets
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...
Francesco Ranzato
97
Voted
DM
2002
110views more  DM 2002»
15 years 20 days ago
Cyclic BSEC of block size 3
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...
Ruizhong Wei
DM
2002
104views more  DM 2002»
15 years 20 days ago
Graphs induced by Gray codes
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...
Elizabeth L. Wilmer, Michael D. Ernst