A simple proof of Moser's theorem

Journal of Graph Theory

Volumn 30, Issue 1, 1999, Pages 19-26

  Zhu, Xuding ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Circular chromatic number; Farey sequence; Planar graphs

Indexed keywords

EID: 0033477474     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199901)30:1<19::AID-JGT3>3.0.CO;2-X     Document Type: Article

References (8)

1. J. A. Bondy and P. Hell, A note on the star chromatic number, J Graph Theory 14 (1990), 479-482.
2. D. R. Guichard, Acyclic graph coloring and the complexity of the star chromatic number, J Graph Theory 17 (1993), 129-134.
3. P. Hell and X. Zhu, Circular chromatic number of series-parallel graphs, (1998), to appear.
4. D. Moser, The star-chromatic number of planar graphs, J Graph Theory 24 (1997), 33-43.
5. A. Vince, Star chromatic number, J Graph Theory 12 (1988), 551-559.
6. X. Zhu, Star chromatic numbers and products of graphs, J Graph Theory 16 (1992), 557-569.
7. X. Zhu, Planar graphs with circular chromatic numbers between 3 and 4 (1997), to appear.
8. X. Zhu, Circular chromatic number, a survey (1997), to appear.