Pith. sign in

REVIEW

Coloring Square-free Berge Graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

Maria Chudnovsky , Irene Lo , Frederic Maffray , Nicolas Trotignon , Kristina Vuskovic This is my paper · ORCID
classification math.CO
keywords bergeclasscoloringgraphsalgorithmchordlessconsidercontain
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools