Strong odd coloring in minor-closed classes
Miriam Goetze, Fabian Klute, Kolja Knauer, Irene Parada, Juan Pablo, Pe\~na, Torsten Ueckerdt

TL;DR
This paper proves that in any proper minor-closed graph class, the strong odd chromatic number is bounded by a constant, and it nearly determines this constant for outerplanar graphs.
Contribution
It establishes a universal bound for the strong odd chromatic number in minor-closed classes and nearly identifies this bound for outerplanar graphs.
Findings
Strong odd chromatic number is bounded by a constant in all proper minor-closed classes.
The minimal such constant is almost determined for outerplanar graphs.
Provides new insights into coloring properties of minor-closed graph classes.
Abstract
We show that the strong odd chromatic number on any proper minor-closed graph class is bounded by a constant. We almost determine the smallest such constant for outerplanar graphs.
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
TopicsColor Science and Applications
