Abstract
This paper proves that for every rational number r between 3 and 4, there exists a planar graph G whose circular chromatic number is equal to r. Combining this result with a recent result of Moser, we arrive at the conclusion that every rational number r between 2 and 4 is the circular chromatic number of a planar graph. © 1999 Academic Press.
Cite
CITATION STYLE
APA
Zhu, X. (1999). Planar Graphs with Circular Chromatic Numbers between 3 and 4. Journal of Combinatorial Theory. Series B, 76(2), 170–200. https://doi.org/10.1006/jctb.1999.1900
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free