| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429215 | Information Processing Letters | 2007 | 7 Pages |
Abstract
In this article we prove that planar graphs without 4-, 6-, 7-, and 8-cycles are 3-colorable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
