The reviewed record of science sign in
Pith

arxiv: 1509.09195 · v2 · pith:3E34AZDA · submitted 2015-09-30 · math.CO

Coloring Square-free Berge Graphs

Maria Chudnovsky , Irene Lo , Frederic Maffray , Nicolas Trotignon , Kristina Vuskovic This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3E34AZDArecord.jsonopen to challenge →

classification math.CO
keywords bergeclasscoloringgraphsalgorithmchordlessconsidercontain
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.