Colourings with Bounded Monochromatic Components in Graphs of Given Circumference
Abstract
We prove that every graph with circumference at most k is O( k)-colourable such that every monochromatic component has size at most O(k). The O( k) bound on the number of colours is best possible, even in the setting of colourings with bounded monochromatic degree.
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.