Coloring squares of planar graphsAMS Spring Western 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 computation to give a proof to this conjecture. This is joint work with Jennifer Diemunsch, Stephen Hartke, and Brent Thomas.
Publication DateApril 9, 2016
LocationSalt Lake City, UT
Citation InformationJennifer Diemunsch, Stephen Hartke, Sogol Jahanbekam and Brent Thomas. "Coloring squares of planar graphs" AMS Spring Western Sectional Meeting (2016)
Available at: http://works.bepress.com/sogol-jahanbekam/26/