| HAL-Inria | Publications, software ... of Inria's scientists |
Reports
Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proof
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.
Cited literature [17 references]
https://hal.inria.fr/inria-00432389
Contributor : Nathann Cohen <>
Submitted on : Monday, November 16, 2009 - 1:13:50 PM
Last modification on : Monday, October 12, 2020 - 10:30:17 AM
Long-term archiving on: : Tuesday, October 16, 2012 - 2:10:22 PM
Contributor : Nathann Cohen <>
Submitted on : Monday, November 16, 2009 - 1:13:50 PM
Last modification on : Monday, October 12, 2020 - 10:30:17 AM
Long-term archiving on: : Tuesday, October 16, 2012 - 2:10:22 PM
File
RR-7098.pdf
Files produced by the author(s)