Title of article
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable Original Research Article
Author/Authors
Yingqian Wang، نويسنده , , Qian Wu، نويسنده , , Liang Shen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
8
From page
232
To page
239
Abstract
It is known that planar graphs without cycles of length 4, image, image, or 9 with image, except that image and image, are 3-choosable. This paper proves that planar graphs without cycles of length 4, 7, 8, or 9 are also 3-choosable.
Keywords
Choosability , Cycle , Coloring , Planar graph
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887563
Link To Document