List Colouring Squares of Planar Graphs

Electronic Notes in Discrete Mathematics

Volumn 29, Issue SPEC. ISS., 2007, Pages 515-519

  Havet, Frédéric ^a   van den Heuvel, Jan ^b   McDiarmid, Colin ^c   Reed, Bruce ^d  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

list colouring; planar graph; square of a graph

Indexed keywords

EID: 34547660291     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2007.07.079     Document Type: Article

References (5)

1. Havet, F., J. van den Heuvel, C. McDiarmid, and B. Reed, List colouring squares of planar graphs. In preparation
2. Kahn J. Asymptotics of the list-chromatic index for multigraphs. Random Structures Algorithms 17 (2000) 117-156
3. Kostochka A.V., and Woodall D.R. Choosability conjectures and multicircuits. Discrete Math. 240 (2001) 123-143
4. Molloy M., and Salavatipour M.R. A bound on the chromatic number of the square of a planar graph. J. Combin. Theory Ser. B 94 (2005) 189-213
5. Wegner, G., Graphs with given diameter and a coloring problem. Technical Report, University of Dortmund, 1977