Title of article :
Planar graphs with maximum degree are -edge-choosable—A short proof
Author/Authors :
Cohen، نويسنده , , Nathann and Havet، نويسنده , , Frédéric، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Abstract :
We give a short proof of the following theorem due to Borodin (1990) [2]. Every planar graph G with maximum degree at least 9 is ( Δ ( G ) + 1 ) -edge-choosable.
Keywords :
List-colouring , Planar graph , edge-colouring , List Colouring Conjecture
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
