Circular chromatic index of small graphs
J\'an Maz\'ak, Filip Zrub\'ak

TL;DR
This paper systematically determines the circular chromatic index of small graphs with maximum degree 4, 5, 6, constructing infinite families and refuting certain conjectures about their properties.
Contribution
It provides comprehensive values for small graphs' circular chromatic index and introduces new infinite graph families with specific index values, challenging existing conjectures.
Findings
Determined circular chromatic index for small graphs with degrees 4, 5, 6.
Constructed infinite families with indices in specific fractional sets.
Refuted variants of the Upper Gap Conjecture for edge-connected graphs.
Abstract
We systematically determine circular chromatic index of small graphs and multigraphs with maximum degree , , (and also their number for a given small order). We construct several infinite families of such graphs with circular chromatic index in the set , . Our results refute edge-connectivity variants of the ``Upper Gap Conjecture'' (about the non-existence of graphs with circular chromatic index just below ).
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.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Interconnection Networks and Systems
