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.
Origin | Files produced by the author(s) |
---|
Loading...