Title of article
A note on 3-choosability of planar graphs without certain cycles
Author/Authors
Li Zhang، نويسنده , , Baoyindureng Wu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
4
From page
206
To page
209
Abstract
Steinberg asked whether every planar graph without 4 and 5 cycles is 3-colorable. Borodin, and independently Sanders and Zhao, showed that every planar graph without any cycle of length between 4 and 9 is 3-colorable. We improve this result by showing that every planar graph without any cycle of length 4, 5, 6, or 9 is 3-choosable.
Keywords
Cycle , Planar graph , Choosability
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948376
Link To Document