The chromatic number of the square of subcubic planar graphs

By Stephen G. Hartke, Sogol Jahanbekam, Brent J. Thomas. 2016

48 citations recorded by the source corpus.

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.

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/ba673e5c8cb83934330e5fb9ef2c7608d6d5e9b9