A Coloring Problem in Hamming Spaces

TheR-domatic number of a graph is the maximum number of colors that can be used to color the vertices of the graph so that all vertices of the graph have at least one vertex of each color within distanceR.In this paper the problem of determining theR-domatic number of then-cube,P(n,R), is considered. The valueP(6,1) =5 is settled, and a conjecture by Laborde thatP(n, 1)?n asntends to infinity is proved. Best known upper and lower bounds on theR-domatic number of then-cube are given forn?16 andR?7.

[1]  Solomon W. Golomb,et al.  Rook domains, Latin squares, affine planes, and error-distributing codes , 1964, IEEE Trans. Inf. Theory.

[2]  Wende Chen,et al.  New lower bounds for binary covering codes , 1988 .

[3]  J-M. Laborde.  On the domatic number of the n-cube and a conjecture of Zelinka (French) , 1987 .

[4]  Patric R. J. Östergård,et al.  Further results on (k, t)-subnormal covering codes , 1992, IEEE Trans. Inf. Theory.

[5]  Stephen T. Hedetniemi,et al.  Towards a theory of domination in graphs , 1977, Networks.

[6]  Bohdan Zelinka,et al.  On $k$-domatic numbers of graphs , 1983 .

[7]  Gerard J. Chang,et al.  The domatic number problem , 1994, Discret. Math..

[8]  T. Etzion,et al.  Constructions for perfect mixed codes and other covering codes , 1993, IEEE Trans. Inf. Theory.

[9]  Walter Alexandre Carnielli,et al.  On covering and coloring problems for rook domains , 1985, Discret. Math..

[10]  Iiro S. Honkala,et al.  On (k, t) -subnormal covering codes , 1991, IEEE Trans. Inf. Theory.

[11]  Bohdan Zelinka,et al.  Domatic numbers of cube graphs , 1982 .

[12]  A. Ingham.  The distribution of prime numbers , 1972 .

[13]  Bohdan Zelinka.  Domination in cubes , 1991 .

[14]  Richard A. Brualdi,et al.  On the Length of Codes with a Given Covering Radius , 1990 .

[15]  N. J. A. Sloane,et al.  On the covering radius of codes , 1985, IEEE Trans. Inf. Theory.

[16]  N. J. A. Sloane,et al.  Further results on the covering radius of codes , 1986, IEEE Trans. Inf. Theory.