| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648864 | Discrete Mathematics | 2010 | 7 Pages |
Abstract
We prove that every planar graph in which no ii-cycle is adjacent to a jj-cycle whenever 3≤i≤j≤73≤i≤j≤7 is 3-colorable and pose some related problems on the 3-colorability of planar graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Oleg V. Borodin, Mickael Montassier, André Raspaud,