Title of article :
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
Author/Authors :
Wang، نويسنده , , Yingqian and Lu، نويسنده , , Huajing and Chen، نويسنده , , Ming، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Abstract :
It is shown that a planar graph without cycles of length 4, 5, 8, or 9 is 3-choosable.
Keywords :
Planar graph , Choosability , Colorability , cycle
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
