The square of a planar cubic graph is 7-colorable
Abstract
We prove the conjecture made by G.Wegner in 1977 that the square of every planar, cubic graph is 7-colorable. Here, 7 cannot be replaced by 6.
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.