Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648874 | Discrete Mathematics | 2010 | 11 Pages |
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 kk-cycles, where k∈{4,5,7}k∈{4,5,7} (or, which is equivalent, with cycles of length 3, 5 and 7), is 3-colorable.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
O.V. Borodin, A.N. Glebov, A. Raspaud,