van den Heuvel, Jan, Havet, F, McDiarmid, C and Reed, B (2007) List colouring squares of planar graphs (extended abstract). Electronic notes in discrete mathematics, 29 . pp. 515-519. ISSN 1571-0653
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.
|Additional Information:||© 2007 Elsevier|
|Library of Congress subject classification:||H Social Sciences > H Social Sciences (General)|
|Sets:||Departments > Mathematics|
|Date Deposited:||09 Jul 2008 08:33|
Actions (login required)
|Record administration - authorised staff only|