Abstract : 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.
https://hal.inria.fr/inria-00432389 Contributor : Nathann CohenConnect in order to contact the contributor Submitted on : Monday, November 16, 2009 - 1:13:50 PM Last modification on : Friday, February 4, 2022 - 3:12:35 AM Long-term archiving on: : Tuesday, October 16, 2012 - 2:10:22 PM