The chromatic number of the square of subcubic planar graphs
  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. 
Stephen G. Hartke, Sogol Jahanbekam, Brent Thomas
math.CO