Skip to main content
Article thumbnail
Location of Repository

List colouring squares of planar graphs (extended abstract)

By Jan van den Heuvel, F Havet, C McDiarmid and B Reed


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

Topics: H Social Sciences (General)
Publisher: Elsevier
Year: 2007
DOI identifier: 10.1016/j.endm.2007.07.079
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.