The circular chromatic conjecture for planar graphs
The circular chromatic conjecture for planar graphs
Let be a positive integer and let be a planar graph of girth at least . The circular chromatic conjecture.
The cases and follow from the Four Color Theorem and Grötzsch's theorem, respectively, while the conjecture remains open for every . It is known for -minor-free graphs, a subclass of planar graphs.
Sources & referencesView supporting material
Primary source
Xiaolan Hu and Jiaao Li, “Circular Coloring and Fractional Coloring in Planar Graphs”, arXiv:2007.00182 (2020).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.