Skip to main content
Coloring squares of planar graphs
AMS Spring Western Sectional Meeting (2016)
  • Jennifer Diemunsch, Saint Vincent College
  • Stephen Hartke, University of Colorado, Denver
  • Sogol Jahanbekam, University of Colorado, Denver
  • Brent Thomas, University of Colorado, Denver
In 1977 Wegner conjectured that the square of any subcubic planar graph is 7-colorable. In this talk we use discharging method and computation to give a proof to this conjecture. This is joint work with Jennifer Diemunsch, Stephen Hartke, and Brent Thomas.
Publication Date
April 9, 2016
Salt Lake City, UT
Citation Information
Jennifer Diemunsch, Stephen Hartke, Sogol Jahanbekam and Brent Thomas. "Coloring squares of planar graphs" AMS Spring Western Sectional Meeting (2016)
Available at: