Library Header Image
LSE Research Online LSE Library Services

List colouring squares of planar graphs (extended abstract)

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

Full text not available from this repository.
Identification Number: 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.

Item Type: Article
Official URL:
Additional Information: © 2007 Elsevier
Divisions: Mathematics
Subjects: H Social Sciences > H Social Sciences (General)
Sets: Departments > Mathematics
Date Deposited: 09 Jul 2008 08:33
Last Modified: 20 Feb 2021 04:08

Actions (login required)

View Item View Item