List colouring squares of planar graphs (extended abstract)
van den Heuvel, J.
, Havet, F., McDiarmid, C. & Reed, B.
(2007).
List colouring squares of planar graphs (extended abstract).
Electronic Notes in Discrete Mathematics,
29, 515-519.
https://doi.org/10.1016/j.endm.2007.07.079
, Havet, F., McDiarmid, C. & Reed, B.
(2007).
List colouring squares of planar graphs (extended abstract).
Electronic Notes in Discrete Mathematics,
29, 515-519.
https://doi.org/10.1016/j.endm.2007.07.079
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.