Graphs without a 3-connected subgraph are 4-colorable
Abstract
In 1972, Mader showed that every graph without a 3-connected subgraph is 4-degenerate and thus 5-colorable. We show that the number 5 of colors can be replaced by 4, which is best possible.
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.