A new bound on the cyclic chromatic number

Journal of Combinatorial Theory. Series B

Volumn 83, Issue 1, 2001, Pages 102-111

  Sanders, Daniel P ^a   Zhao, Yue ^b  

^a University of Central Florida ^*  (United States)

^b UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035191181     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2046     Document Type: Article

References (6)

1. Every planar map is four colorable: Part 1, Discharging
2. Solution of Ringel's problem on vertex-face coloring of plane graphs and coloring of 1-planar graphs
3. Cyclic colorings and their generalizations
4. Cyclic coloration of plane graphs
5. The four-colour theorem