Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648862 | Discrete Mathematics | 2010 | 12 Pages |
Abstract
It is shown that a planar graph without cycles of length 4, 5, 8, or 9 is 3-choosable.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yingqian Wang, Huajing Lu, Ming Chen,