Coloring Square-free Berge Graphs
arXiv:1509.09195 · doi:10.1016/j.jctb.2018.07.010
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.