Planar graphs with maximum degree Δ≥9 are (Δ+1)-edge-choosable—A short proof
Abstract
We give a short proof of the following theorem due to Borodin (1990). Every planar graph G with maximum degree at least 9 is (Δ(G)+1)-edge-choosable.