Circular edge-colorings of cubic graphs with girth six
D. Kr\'al', E. M\'acajov\'a, J. Maz\'ak, J.-S. Sereni
TL;DR
This paper proves that for any subcubic graph with girth at least six, the circular chromatic index does not exceed 3.5, advancing understanding of edge-coloring constraints in such graphs.
Contribution
It establishes a new upper bound of 7/2 for the circular chromatic index of subcubic graphs with girth at least six, which was previously unknown.
Findings
Circular chromatic index of such graphs is at most 7/2
Girth condition is crucial for the bound
Advances edge-coloring theory for cubic graphs
Abstract
We show that the circular chromatic index of a (sub)cubic graph with girth at least six is at most 7/2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.