List colouring squares of planar graphs (extended abstract)
Jan van den Heuvel, Frédéric Havet, Colin McDiarmid, Bruce A. Reed · 2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree Δ⩾8 is at most View the MathML source. We show that it is at most View the MathML source, and indeed this is true for the list chromatic number.