Coloring the square of a planar graph

In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most ⌈ 3 2 ∆ ⌉ + 1. We show that it is at most ∆ (1 + o(1)).