Coloring square-free Berge graphs

/ Authors

M. Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic

/ Abstract

We consider the class of Berge graphs that do not contain a chordless cycle of length $4$. We present a purely graph-theoretical algorithm that produces an optimal coloring in polynomial time for every graph in that class.

Journal: J. Comb. Theory B

DOI: 10.1016/j.jctb.2018.07.010

Coloring square-free Berge graphs

/ Authors

M. Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic

/ Abstract

We consider the class of Berge graphs that do not contain a chordless cycle of length $4$. We present a purely graph-theoretical algorithm that produces an optimal coloring in polynomial time for every graph in that class.

Journal: J. Comb. Theory B

DOI: 10.1016/j.jctb.2018.07.010