کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4650386 | 1342485 | 2008 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Acyclic edge coloring of subcubic graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Acyclic edge coloring of subcubic graphs Acyclic edge coloring of subcubic graphs](/preview/png/4650386.png)
چکیده انگلیسی
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number kk such that there is an acyclic edge coloring using kk colors and it is denoted by a′(G)a′(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using five colors. This result is tight since there are 3-regular graphs which require five colors. In this paper we prove that any non-regular connected graph of maximum degree 3 is acyclically edge colorable using at most four colors. This result is tight since all edge maximal non-regular connected graphs of maximum degree 3 require four colors.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 308, Issue 24, 28 December 2008, Pages 6650–6653
Journal: Discrete Mathematics - Volume 308, Issue 24, 28 December 2008, Pages 6650–6653
نویسندگان
Manu Basavaraju, L. Sunil Chandran,