A note on cycle lengths in graphs of chromatic number five and six
Abstract
In this note, we prove that every non-complete (k+1)-critical graph contains cycles of all lengths modulo k, where k=4,5.
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.