| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428338 | Information Processing Letters | 2007 | 5 Pages |
Abstract
In this paper we prove that every planar graph without cycles of length 4, 6, 7 and 9 is 3-colorable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
