REVIEW
Not yet reviewed by Pith; the record is open.
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
Coloring Square-free Berge Graphs
classification
math.CO
keywords
bergeclasscoloringgraphsalgorithmchordlessconsidercontain
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.