Strong odd coloring in minor-closed classes
Combinatorics
2025-05-06 v1
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.
Cite
@article{arxiv.2505.02736,
title = {Strong odd coloring in minor-closed classes},
author = {Miriam Goetze and Fabian Klute and Kolja Knauer and Irene Parada and Juan Pablo Peña and Torsten Ueckerdt},
journal= {arXiv preprint arXiv:2505.02736},
year = {2025}
}