Skip to main content
Unpublished Paper
The chromatic number of the square of subcubic planar graphs
(2016)
  • Stephen G. Hartke, University of Colorado, Denver
  • Sogol Jahanbekam, University of Colorado, Denver
  • Brent Thomas, University of Colorado, Denver
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.
Keywords
  • coloring,
  • square,
  • subcubic,
  • planar graph,
  • discharging,
  • computational proof
Publication Date
April 21, 2016
Comments
This work is also available on Arxiv.org at this link.
Citation Information
Stephen 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/