Title of article
Planar graphs without adjacent cycles of length at most seven are 3-colorable
Author/Authors
Borodin، نويسنده , , Oleg V. and Montassier، نويسنده , , Mickael and Raspaud، نويسنده , , André، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
7
From page
167
To page
173
Abstract
We prove that every planar graph in which no i -cycle is adjacent to a j -cycle whenever 3 ≤ i ≤ j ≤ 7 is 3-colorable and pose some related problems on the 3-colorability of planar graphs.
Keywords
The 3-color problem
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1599220
Link To Document