Coloring Square-free Berge Graphs
Combinatorics
2023-10-23 v2
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.
Keywords
Cite
@article{arxiv.1509.09195,
title = {Coloring Square-free Berge Graphs},
author = {Maria Chudnovsky and Irene Lo and Frederic Maffray and Nicolas Trotignon and Kristina Vuskovic},
journal= {arXiv preprint arXiv:1509.09195},
year = {2023}
}