Circular chromatic number: A survey

Discrete Mathematics

Volumn 229, Issue 1-3, 2001, Pages 371-410

  Zhu, Xuding ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Chromatic number; Circular chromatic number; Circular flow; Distance graph; Flow; Fractional chromatic number; Girth; Graph homomorphism; Graph minor; Mycieski graphs; Planar graphs; Weighted graph

Indexed keywords

EID: 0000406854     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00217-X     Document Type: Article

References (102)

1. H.L. Abbott, B. Zhou, The star chromatic number of a graph, J. Graph Theory 17 (1993) 349-360.
2. U. Betke, J.M. Wills, Untere schranken für zwei diophantische funktionen, Montasch. Math. 76 (1972) 214-217.
3. B. Bauslaugh, X. Zhu, Circular coloring of infinite graphs, Bulletin of the ICA 24 (1998) 79-80.
4. W. Bienia, L. Goddyn, P. Gvozdjak, A. Sebo, M. Tarsi, Flows, view obstructions, and the lonely runner, J. Combin. Theory (B) 72 (1998) 1-9.
5. B. Bollobás, N. Sauer, Uniquely colorable graphs with large girth, Canad. J. Math. 28 (1976) 1340-1344.
6. J.A. Bondy, P. Hell, A note on the star chromatic number, J. Graph Theory 14 (1990) 479-482.
7. S. Brandt, On the structure of dense triangle-free graphs, Fachbereich Mathematik und Informatik, Series A Mathematik, preprint No. A 97-16.
8. D.G. Cantor, B. Gordon, Sequences of integers with missing differences, J. Combin. Theory Ser. (A) 14 (1973) 281-287.
9. B. Codenotti, I. Gerace, S. Vigna, Hardness results and spectral techniques for combinatorial problems on circulant graphs, manuscript, 1998.
10. M.B. Cozzens, F.S. Roberts, T-colorings of graphs and the channel assignment problems, Congr. Numer. 35 (1982) 191-208.
11. G.J. Chang, L. Huang, X. Zhu, The circular chromatic number of Mycielski's graphs, Discrete Math. 205 (1999) 23-37.
12. G.J. Chang, L. Huang, X. Zhu, The circular chromatic numbers and the fractional chromatic numbers of distance graphs, European J. Combin. 19 (1998) 423-431.
13. G.J. Chang, D. Liu, X. Zhu, Distance graphs and T-coloring, J. Combin. Theory 75 (1999) 259-269.
14. Y.G. Chen, On a conjecture about diophantine approximations, I, Acta Math. Sinica 33 (1990) 712-717 (in Chinese).
15. J. Chien, X. Zhu, The circular chromatic number of series-parallel graphs of large girth, J. Graph Theory 33 (2000) 185-198.
16. T.W. Cusick, View-obstruction problems, Aequationes Math. 9 (1973) 165-170.
17. T.W. Cusick, View-obstruction problems in n-dimensional geometry, J. Combin. Theory (A) 16 (1974) 1-11.
18. T.W. Cusick, View-obstruction problems, II, Proc. Amer. Math. Soc. 84 (1982) 25-28.
19. T.W. Cusick, C. Pomerance, View-obstruction problems, III, J. Number Theory 19 (1984) 131-139.
20. W. Deuber, X. Zhu, Circular coloring of weighted graphs, J. Graph Theory 23 (1996) 365-376.
21. W. Deuber, X. Zhu, The chromatic number of distance graphs with distance sets missing multiples, manuscript, 1998.
22. R.B. Eggleton, P. Erdos, D.K. Skilton, Coloring the real line, J. Combin. Theory Ser. (B) 39 (1985) 86-100.
23. D.C. Fisher, Fractional colorings with large denominators, J. Graph Theory 20 (1995) 403-409.
24. El-Zahar, N. Sauer, The chromatic number of the product of two 4-chromatic graphs is 4, Combinatorica 5 (1985) 121-126.
25. G. Gao, G. Hahn, H. Zhou, Star-chromatic number of flower graphs, manuscript, 1992.
26. G. Gao, E. Mendelsohn, H. Zhou, Computing star chromatic number from related graph invariants, J. Combin. Math. Combin. Comput., to appear.
27. G. Gao, X. Zhu, Star extremal graphs and the lexicographic product, Discrete Math. 152 (1996) 147-156.
28. L. Goddyn, personal communication, 1997.
29. L.A. Goddyn, M. Tarsi, C.Q. Zhang, On (k,d)-colorings and fractional nowhere-zero flows, J. Graph Theory 28 (1998) 155-161.
30. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
31. D. Greenwell, L. Lovász, Applications of product coloring, Acta Math. Acad. Sci. Hungar. 25 (1974) 335-340.
32. J.R. Griggs, D.D.-F. Liu, The channel assignment problem for mutually adjacent sites, J. Combin. Theory Ser. A 68 (1994) 169-183.
33. H. Grötsch, Ein Dreifarbensatz für dreikreisfreie Netze auf Kugel, Wiss. Z. Martin Luther-Univ. Halle Wittenberg, Math.-Nat. Reihe 8 (1959) 109-120.
34. D.R. Guichard, Acyclic graph coloring and the complexity of the star chromatic number, J. Graph Theory 17 (1993) 129-134.
35. L. Haddad, H. Zhou, Star chromatic numbers of hypergraphs and partial steiner triple systems, Discrete Math. 146 (1995) 45-58.
36. R. Haggkvist, P. Hell, D.J. Miller, V. Neumann Lara, On multiplicative graphs and the product conjecture, Combinatorica 8 (1988) 63-74.
37. G. Hahn, C. Tardif, Graph homomorphisms: structure and symmetry, manuscript, 1997.
38. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
39. N.M. Haralambis, Sets of integers with missing differences, J. Combin. Theory Ser. (A) 23 (1977) 22-33.
40. Hedetniemi, Homomorphisms and graph automata, University of Michigan Technical Report 03105-44-T, 1966.
41. A. Galluccio, L. Goddgn and P. Hell, High girth graphs avoiding a minor are nearly bipartite, J. Combin. Th. (B) to appear.
42. P. Hell, J. Nešetřil, On the complexity of H-colouring, J. Combin. Theory B 48 (1990) 92-110.
43. P. Hell, X. Yu, H. Zhou, Independence ratios of graph powers, Discrete Math. 127 (1994) 213-220.
44. P. Hell, X. Zhu, The circular chromatic number of series-parallel graphs, J. Graph Theory 33 (2000) 14-24.
45. A.J.W. Hilton, R. Rado, S.H. Scott, A (< 5)-colour theorem for planar graphs, Bull. London Math. Soc. 5 (1973) 302-306.
46. A.J. Hoffman, Some recent applications of the theory of linear inequalities to extremal combinatorial analysis, Proceedings of the Symposium on Applied Mathematics, Vol. 10 (1960) pp 113-127.
47. T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York, 1995.
48. A. Johnson, F.C. Holroyd, S. Stahl, Multichromatic numbers, star chromatic numbers and Kneser graphs, J. Graph Theory 26 (1997) 137-145.
49. k, J. Graph Theory 32 (1999) 63-74.
50. L. Huang, G. Chang, Circular chromatic numbers of distance graphs with distance set missing multiples, Europ. J. Combin. 20 (1999) 1-8.
51. A. Kemnitz, H. Kolberg, Coloring of integer distance graphs, Technical Report, Institute für Mathematik, Technische Universität Braunschweig, 1996.
52. Y. Kirsch, personal communication.
53. M. Kneser, Aufgabe 300, Jber. Deutsch. Math.-Verein. 58 (1955) 27.
54. S. Klavžar, Coloring of graph products - a survey, Discrete Math. 155 (1996) 135-145.
55. S. Klavžar, A note on the fractional chromatic number and the lexicographic product of graphs, Discrete Math. 185 (1998) 259-263.
56. W. Klostermeyer, C.Q. Zhang, (2k + 1)/k-coloring of planar graphs with large odd girth, J. Graph Theory 33 (2000) 109-119.
57. M. Larsen, J. Propp, D. Ullman, The fractional chromatic number of Mycielski's graphs, J. Graph Theory 19 (1995) 411-416.
58. K.W. Lih, D. Liu, X. Zhu, Star-extremal circulant graphs, SIAM J. Discrete Math. 12 (1999) 491-499.
59. D. Liu, T-colorings of graphs, Discrete Math. 101 (1992) 203-212.
60. D. Liu, T-graphs and the channel assignment problem, Discrete Math. 161 (1996) 197-205.
61. D. Liu, X. Zhu, Distance graphs with missing multiples in the distance sets, J. Graph Theory 30 (1999) 245-259.
62. L. Lovász, Kneser's conjecture, chromatic number, and homotopy, J. Combin. Theory (A) 25 (1978) 319-324.
63. D. Moser, The star-chromatic number of planar graphs, J. Graph Theory 24 (1997) 33-43.
64. V. Müller, On colorable critical and uniquely colorable critical graphs, in: M. Fiedler (Ed.), Recent Advances in Graph Theory, Academia, Prague, 1975.
65. V. Müller, On coloring of graphs without short cycles, Discrete Math. 26 (1979) 165-179.
66. J. Nešetřil, On uniquely colorable graphs without short cycles, Casopis Pèst. Mat. 98 (1973) 122-125.
67. J. Nešetřil, Structure of graph homomorphisms, J. Combin. Probab. Comput. (1999).
68. J. Nešetřil, V. Rödl, Chromatically optimal rigid graphs, J. Combin. Theory (B) 46 (1989) 133-141.
69. J. Nešetřil, X. Zhu, On bounded treewidth duality of graphs, J. Graph Theory 23 (1996) 151-162.
70. J. Nešetřil, X. Zhu, On Sparse Graphs with Given Colorings and Homomorphisms, manuscript, 2000.
71. J. Pach, Graphs whose every independent set has a common neighbour, Discrete Math. 37 (1981) 217-228.
72. Z. Pan, X. Zhu, Density of the circular chromatic numbers of series-parallel graphs, manuscript, 1999.
73. Z. Pan, X. Zhu, Circular chromatic number of series-parallel graphs of large odd girth, manuscript, 1999.
74. J.H. Rabinowitz, V.K. Proulx, An asymptotic approach to the channel assignment problem, SIAM J. Algebraic Discrete Methods 6 (1985) 507-518.
75. E. Steffen, X. Zhu, On the star chromatic numbers of graphs, Combinatorica 16 (1996) 439-448.
76. E. Steffen, Circular flow numbers of regular multigraphs, J. Graph Theory, to appear.
77. C.L. Stewart, R. Tijdeman, On infinite-difference sets, Canad. J. Math. 31 (1979) 879-910.
78. A. Vince, Star chromatic number, J. Graph Theory 12 (1988) 551-559.
79. J.M. Wills, Zwei Sätze über inhomogene diophantische approximation von irrationlzahlen, Monatsch. Math. 71 (1967) 263-269.
80. J.M. Wills, Zur simultanen homogenen diophantischen approximation, I, Monatsch. Math. 72 (1968) 254-263.
81. J.M. Wills, Zur simultanen homogenen diophantischen approximation, II, Monatsch. Math. 72 (1968) 368-381.
82. J.M. Wills, Zur simultanen homogenen diophantischen approximation, III, Monatsch. Math. 74 (1970) 166-171.
83. J.M. Wills, Zur simultanen homogenen diophantischen approximation, Zahlentheorie (Tagung, Math. Forschungsinst, Oberwolfach, 1970), Ber. Math. Forschungsinst., Oberswolfach, Vol. 5, Bibliographisches Inst., Mannhaim, 1971, pp. 223-227.
84. H. Yeh, X. Zhu, Coloring some circulant graphs, manuscript, 1999.
85. C.Q. Zhang, Circular flows of nearly eulerian graphs and vertex-splitting, manuscript, 1999.
86. B. Zhou, Some theorems concerning the star chromatic number of a graph, J. Combin. Theory (B) 70 (1997) 245-258.
87. X. Zhu, On the bounds for the ultimate independence ratio of a graph, Discrete Math. 156 (1996) 229-236.
88. X. Zhu, Star chromatic numbers and products of graphs, J. Graph Theory 16 (1992) 557-569.
89. X. Zhu, Uniquely H-colorable graphs with large girth, J. Graph Theory 23 (1996) 33-41.
90. X. Zhu, The circular chromatic number and the fractional chromatic number of a graph, manuscript, 1996.
91. X. Zhu, A simple proof of Moser's theorem, J. Graph Theory 30 (1999) 19-26.
92. X. Zhu, Planar graphs with circular chromatic numbers between 3 and 4, J. Combin. Theory (B) 76 (1999) 170-200.
93. X. Zhu, Coloring distance graphs on the real line, manuscript, 1996.
94. X. Zhu, The circular chromatic number of distance graphs with distance sets of cardinality 3, manuscript, 1999.
95. X. Zhu, Circular coloring and graph homomorphisms, Bull. Austral. Math. Soc. 59 (1999) 83-97.
96. X. Zhu, Construction of uniquely H-colorable graphs, J. Graph Theory 30 (1999) 1-6.
97. X. Zhu, Graphs whose circular chromatic number equal the chromatic number, Combinatorica 19 (1999) 139-149.
98. X. Zhu, Circular chromatic number and graph minor, Taiwanese J. of Mathematics, to appear.
99. X. Zhu, The circular chromatic number of a class of distance graphs, manuscript, 1998.
100. X. Zhu, Diophantine approximations and applications to graph coloring and flows, manuscript, 1998.
101. X. Zhu, Circular perfect graphs, manuscript, 1999.
102. X. Zhu, An analogue of Hajós' theorem for the circular chromatic number, Proceedings of the American Mathematical Society, to appear.