Circular chromatic number of planar graphs of large odd girth

Electronic Journal of Combinatorics

Volumn 8, Issue 1 R, 2001, Pages 1-11

  Zhu, Xuding ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346234032     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1569     Document Type: Article

References (22)

1. J. Chien and X. Zhu, The circular chromatic number of series-parallel graphs of large girth, J. Graph Theory, 33(2000), 185-198.
2. M. DeVos, Communication at workshop on flows and cycles, Simon Fraser University, 2000.
3. A. Galluccio, L. Goddyn and P. Hell, High girth graphs avoiding a minor are nearly bipartite, J. Combinatorial Theory (B), to appear.
4. L. A. Goddyn, M. Tarsi, and C. Q. Zhang, On (k; d)-colorings and fractional nowherezero flows, J. Graph Theory, 28(1998), 155-161.
5. H. Grötzsch, Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wissenschaftliche Zeitschrift der Martin-Luther-Universität Halle-Wittenberg, Mathematisch-Naturwissenschaftliche Reihe, 8 (1958/1959), 109-120
6. P. Hell and X. Zhu, The circular chromatic number of series-parallel graphs, J. Graph Theory, 33(2000), 14-24.
7. F. Jaeger, On circular flows in graphs, Finite and In finite Sets (Eger, 1981), Colloquia Mathematica Societatis János Bolyai 37, North Holland, (1984) 391-402.
8. F. Jaeger, Nowhere-zero flow problems, Selected Topics in Graph Theory 3, (L. W. Beineke and R. J. Wilson eds.), Academic Press, London, (1988) 71-95.
9. W. Klostermeyer and C.Q.Zhang, (2+ ∈)-coloring of planar graphs with large odd girth, J. Graph Theory, 33(2000), 109-119.
10. D. Moser, The star chromatic number of planar graphs, J. Graph Theory, 24 (1997), 33-43
11. Z. Pan and X. Zhu, Circular chromatic number of series-parallel graphs of large odd girth, Discrete Mathematics, to appear.
12. Z. Pan and X. Zhu, Tight relation between the circular chromatic and girth of seriesparallel graphs, manuscript, 2000.
13. J. Nešetřil and X. Zhu, On Bounded Tree-Width Duality of Graphs, J. Graph Theory, 23 (1996), 151-162
14. E. Steffen and X. Zhu, On the star chromatic numbers of graphs, Combinatorica, 16(1996), 439-448.
15. C. Thomassen, Grötzsch's 3-colour theorem and its counterparts for torus and the projective plane, J. Combinatorial Theory (B) 62 (1994), 268-279
16. W. T. Tutte, A geometrical version of the four color problem, Combinatorial Mathematics and its Applications, (eds. R.C.Bose and T.A.Dowling), University of North Carolina Press, Chapel Hill, (1967).
17. W. T. Tutte, A contribution on the theory of chromatic polynomial, Canad. J. Math., 6(1954), 80-91.
18. A. Vince, Star chromatic number, J. Graph Theory 12 (1988), 551-559.
19. C.Q.Zhang, Circular flows of nearly eulerian graphs and vertex splitting, manuscript, 2000.
20. C.Q.Zhang, Integer flows and cycle covers of graphs, Marcel Dekker Inc. New York, (1997).
21. X. Zhu, Planar graphs with circular chromatic numbers between 3 and 4, J. Combinatorial Theory (B), 76(1999), 170-200.
22. X. Zhu, Circular chromatic number: a survey, Discrete Mathematics, 229 (1-3) (2001), 371-410.