کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
420399 | 683934 | 2009 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable](/preview/png/420399.png)
چکیده انگلیسی
The Total Coloring Conjecture, in short, TCC, says that every simple graph is (Δ+2)(Δ+2)-totally-colorable where ΔΔ is the maximum degree of the graph. Even for planar graphs this conjecture has not been completely settled yet. However, every planar graph with Δ≥9Δ≥9 has been proved to be (Δ+1)(Δ+1)-totally-colorable. In this paper, we prove that planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 157, Issue 13, 6 July 2009, Pages 2778–2784
Journal: Discrete Applied Mathematics - Volume 157, Issue 13, 6 July 2009, Pages 2778–2784
نویسندگان
Dingzhu Du, Lan Shen, Yingqian Wang,