On Wegner's 8-Coloring Theorem for Planar Graphs of Maximum Degree Three
Abstract
We provide a simplified proof of the following special case of Wegner's conjecture: every planar graph of maximum degree at most three admits a distance-2 coloring with at most eight colors. Our main contribution is significant simplification of the most technically challenging part of Wegner's proof: the case involving the removal of a 5-cycle.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.