Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof

Nathann Cohen, Frédéric Havet. Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. Discrete Mathematics, 310(21):3049-3051, 2010. [doi]

Abstract

Abstract is missing.