-
1
-
-
0032388886
-
Circular chromatic numbers and fractional chromatic numbers of distance graphs
-
G.J. Chang, L. Huang, and X. Zhu, Circular chromatic numbers and fractional chromatic numbers of distance graphs, Europ J Comb, 19 (1998), 423-431.
-
(1998)
Europ J Comb
, vol.19
, pp. 423-431
-
-
Chang, G.J.1
Huang, L.2
Zhu, X.3
-
3
-
-
0031523759
-
Integral distance graphs
-
J.J. Chen, G.J. Chang, and K.C. Huang, Integral distance graphs, J Graph Theory 25 (1997), 287-294.
-
(1997)
J Graph Theory
, vol.25
, pp. 287-294
-
-
Chen, J.J.1
Chang, G.J.2
Huang, K.C.3
-
4
-
-
0039422175
-
The chromatic number of distance graphs
-
W. Deuber and X. Zhu, The chromatic number of distance graphs, Disc Math 165/166 (1997), 195-204.
-
(1997)
Disc Math
, vol.165-166
, pp. 195-204
-
-
Deuber, W.1
Zhu, X.2
-
6
-
-
0001844672
-
Coloring the real line
-
R.B. Eggleton, P. Erdos, and D.K. Skilton, Coloring the real line, J Comb Theory Series B 39 (1985), 86-100.
-
(1985)
J Comb Theory Series B
, vol.39
, pp. 86-100
-
-
Eggleton, R.B.1
Erdos, P.2
Skilton, D.K.3
-
7
-
-
46149135481
-
Research problem 77
-
R.B. Eggleton, P. Erdos, and D.K. Skilton, Research problem 77, Disc Math 58 (1986), 323.
-
(1986)
Disc Math
, vol.58
, pp. 323
-
-
Eggleton, R.B.1
Erdos, P.2
Skilton, D.K.3
-
8
-
-
0039422173
-
Update information on research problem 77
-
R.B. Eggleton, P. Erdos, and D.K. Skilton, Update information on research problem 77, Disc Math. 69 (1988), 105.
-
(1988)
Disc Math.
, vol.69
, pp. 105
-
-
Eggleton, R.B.1
Erdos, P.2
Skilton, D.K.3
-
9
-
-
0004539664
-
Coloring prime distance graphs
-
R.B. Eggleton, P. Erdos, and D.K. Skilton, Coloring prime distance graphs, Graph Comb 32 (1990), 17-32.
-
(1990)
Graph Comb
, vol.32
, pp. 17-32
-
-
Eggleton, R.B.1
Erdos, P.2
Skilton, D.K.3
-
10
-
-
0002512840
-
The channel assignment problem for mutually adjacent sites
-
J.R. Griggs and D.D.-F. Liu, The channel assignment problem for mutually adjacent sites, J Comb Theory Series A, 68 (1994), 169-183.
-
(1994)
J Comb Theory Series A
, vol.68
, pp. 169-183
-
-
Griggs, J.R.1
Liu, D.D.-F.2
-
11
-
-
0346811457
-
Circular chromatic number of distance graphs with distance set missing multiples
-
to appear
-
L. Huang and G.J. Chang, Circular chromatic number of distance graphs with distance set missing multiples, Europ J Comb, to appear.
-
Europ J Comb
-
-
Huang, L.1
Chang, G.J.2
-
12
-
-
0040223109
-
Coloring of integer distance graphs
-
A. Kemnitz and H. Kolberg, Coloring of integer distance graphs, Disc Math, 191 (1998), 113-123.
-
(1998)
Disc Math
, vol.191
, pp. 113-123
-
-
Kemnitz, A.1
Kolberg, H.2
-
13
-
-
85030056270
-
T-coloring and chromatic number of distance graphs
-
to appear
-
D.D.-F. Liu, T-coloring and chromatic number of distance graphs, Ars Comb, to appear.
-
Ars Comb
-
-
Liu, D.D.-F.1
-
15
-
-
0347806730
-
Coloring of distance graphs
-
to appear
-
M. Voigt, Coloring of distance graphs, Ars Comb, to appear.
-
Ars Comb
-
-
Voigt, M.1
-
16
-
-
38149147869
-
Chromatic number of prime distance graphs
-
M. Voigt and H. Walther, Chromatic number of prime distance graphs, Disc Appl Math 51 (1994), 197-209.
-
(1994)
Disc Appl Math
, vol.51
, pp. 197-209
-
-
Voigt, M.1
Walther, H.2
-
18
-
-
0009297230
-
Pattern-periodic coloring of distance graphs
-
X. Zhu, Pattern-periodic coloring of distance graphs, J Comb Theory Series B 73 (1998), 195-206.
-
(1998)
J Comb Theory Series B
, vol.73
, pp. 195-206
-
-
Zhu, X.1
|