Coloring claw-free graphs with -1 colors
Abstract
We prove that every claw-free graph G that doesn't contain a clique on (G) ≥ 9 vertices can be (G) - 1 colored.
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.