Chromatic number of squares of planar graphsAMS Spring Central Sectional Meeting (2016)
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 DateApril 16, 2016
Citation InformationJennifer 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/