Graphs that contain a K1,2,3 and no induced subdivision of K4 are 4-colorable
Abstract
In 2012, L\'ev\eque, Maffray, and Trotignon conjectured that each graph G that contains no induced subdivision of K4 is 4-colorable. In this paper, we prove that this conjecture holds when G contains a K1,2,3.
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.