Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proof

Nathann Cohen (1) , Frédéric Havet (1)

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications

We give a short proof of the following theorem due to Borodin~\cite{Bor90}. Every planar graph with maximum degree $\Delta\geq 9$ is $(\Delta+1)$-edge-choosable.

Keywords: edge-colouring; list colouring; List Colouring Conjecture; planar graphs

Domains: Discrete Mathematics [cs.DM]

Nathann Cohen, Frédéric Havet. Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proof. [Research Report] RR-7098, INRIA. 2009. ⟨inria-00432389⟩