On a hypercube coloring problem

Journal of Combinatorial Theory. Series A

Volumn 108, Issue 2, 2004, Pages 199-204

  Östergård, Patric R J ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Binary code; Chromatic number; Hypercube; Vertex coloring

Indexed keywords

EID: 9144229276     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcta.2004.06.010     Document Type: Article

References (11)

1. M.R. Best A.E. Brouwer The triply shortened binary Hamming code is optimal Discrete Math. 17 1977 235-245
2. M.N. Huxley The Distribution of Prime Numbers 1972 Clarendon Press Oxford
3. T.R. Jensen B. Toft Graph Coloring Problems 1995 Wiley New York
4. G.A. Kabatyanskii V.I. Panchenko Unit sphere packings and coverings of the Hamming space Problemy Peredachi Informatsii 24 4 1988 3-16 in Russian; Engl. transl. Problems Inform. Transmission 24 1988 261-272
5. D.S. Kim D.-Z. Du P.M. Pardalos A coloring problem on the n -cube Discrete Appl. Math. 103 2000 307-311
6. N. Linial R. Meshulam M. Tarsi Matroidal bijections between graphs J. Combin. Theory Ser. B 45 1988 31-44
7. F.J. MacWilliams N.J.A. Sloane The Theory of Error-Correcting Codes 1977 North-Holland Amsterdam
8. H.Q. Ngo D.-Z. Du R.L. Graham New bounds on a hypercube coloring problem Inform. Process. Lett. 84 2002 265-269
9. P.R.J. Östergård A coloring problem in Hamming spaces European J. Combin. 18 1997 303-309
10. P.-J. Wan Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network J. Combin. Optim. 1 1997 179-186
11. G.M. Ziegler Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions H. Alt (Ed.) Computational Discrete Mathematics 2001 Springer Berlin 159-171