Title of article :
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
Author/Authors :
Borodin، نويسنده , , O.V. and Glebov، نويسنده , , A.N. and Raspaud، نويسنده , , A.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Pages :
11
From page :
2584
To page :
2594
Abstract :
It is known that planar graphs without cycles of length from 4 to 7 are 3-colorable (Borodin et al., 2005) [13] and that planar graphs in which no triangles have common edges with cycles of length from 4 to 9 are 3-colorable (Borodin et al., 2006) [11]. We give a common extension of these results by proving that every planar graph in which no triangles have common edges with k -cycles, where k ∈ { 4 , 5 , 7 } (or, which is equivalent, with cycles of length 3, 5 and 7), is 3-colorable.
Keywords :
3-coloring , graph , Planar graph
Journal title :
Discrete Mathematics
Serial Year :
2010
Journal title :
Discrete Mathematics
Record number :
1599411
Link To Document :
بازگشت