Coloring Square-free Berge Graphs
Maria Chudnovsky, Irene Lo, Frederic Maffray, Nicolas Trotignon,, Kristina Vuskovic
TL;DR
This paper introduces a polynomial-time algorithm for optimally coloring a specific class of Berge graphs that lack chordless cycles of length four, advancing graph coloring theory.
Contribution
It provides the first purely graph-theoretical polynomial-time coloring algorithm for square-free Berge graphs.
Findings
Optimal coloring achieved in polynomial time
Algorithm applies to square-free Berge graphs
Advances understanding of graph coloring complexity
Abstract
We consider the class of Berge graphs that do not contain a chordless cycle of length . We present a purely graph-theoretical algorithm that produces an optimal coloring in polynomial time for every graph in that class.
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 Labeling and Dimension Problems · Graph theory and applications