Skip to main content
Presentation
Chromatic number of squares of planar graphs
AMS Spring Central 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
Abstract
In 1977 Wegner conjectured that the square of any subcubic planar graph is 7-colorable. In this talk we use discharging method and computations to give a proof to this conjecture.
Publication Date
April 16, 2016
Location
Fargo, ND
Citation Information
Jennifer Diemunsch, Stephen Hartke, Sogol Jahanbekam and Brent Thomas. "Chromatic number of squares of planar graphs" AMS Spring Central Sectional Meeting (2016)
Available at: http://works.bepress.com/sogol-jahanbekam/25/