The chromatic number of the square of subcubic planar graphs(2016)
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.
- planar graph,
- computational proof
Publication DateApril 21, 2016
Citation InformationStephen G. Hartke, Sogol Jahanbekam and Brent Thomas. "The chromatic number of the square of subcubic planar graphs" (2016)
Available at: http://works.bepress.com/sogol-jahanbekam/8/