An Upper bound on the chromatic number of circle graphs without K4
Abstract
Let G be a circle graph without clique on 4 vertices. We prove that the chromatic number of G doesn't exceed 30.
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.