List Colouring Squares of Planar Graphs

In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree Δ⩾8 is at most . We show that it is at most , and indeed this is true for the list chromatic number.