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
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 |
|---|---|
| Departments | Mathematics |
| DOI | 10.1016/j.endm.2007.07.079 |
| Date Deposited | 09 Jul 2008 08:33 |
| URI | https://researchonline.lse.ac.uk/id/eprint/6740 |
Explore Further
- http://www.sciencedirect.com/science/journal/15710... (Official URL)
ORCID: https://orcid.org/0000-0003-0897-9148