کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4648874 1342434 2010 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 310, Issue 20, 28 October 2010, Pages 2584–2594
نویسندگان
, , ,