The chromatic number of the square of subcubic planar graphs

Abstract

Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most $3$ is $7$-colorable. We prove this conjecture using the discharging method and computational techniques to verify reducible configurations.

Cited by in corpus (3)

• 2-distance list $(\Delta +3)$-coloring of sparse graphs
• Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4
• Distance-Two Colorings of Barnette Graphs