| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428147 | Information Processing Letters | 2007 | 6 Pages |
Abstract
It is shown that a planar graph without cycles of length 4, 6, 8, or 9 is 3-choosable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
