Coloring Square-free Berge Graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.