List colouring squares of planar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

List colouring squares of planar graphs


In 1977, Wegner conjectured that the chromatic number of the square of every planar graph~$G$ with maximum degree $\Delta\ge8$ is at most $\bigl\lfloor\frac32\,\Delta\bigr\rfloor+1$. We show that it is at most $\frac32\,\Delta\,(1+o(1))$, and indeed this is true for the list chromatic number and for more general classes of graphs.
Fichier principal
Vignette du fichier
RR-6586.pdf (477.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00303303 , version 1 (21-07-2008)


  • HAL Id : inria-00303303 , version 1


Frédéric Havet, Jan van den Heuvel, Colin Mcdiarmid, Bruce Reed. List colouring squares of planar graphs. [Research Report] RR-6586, INRIA. 2008. ⟨inria-00303303⟩
192 View
262 Download


Gmail Facebook X LinkedIn More