Document Type

Article

Publication Date

April 2016

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.

Comments

This work is also available on Arxiv.org at this link.

Share

COinS