کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
428256 686622 2008 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Acyclic coloring of graphs of maximum degree five: Nine colors are enough
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Acyclic coloring of graphs of maximum degree five: Nine colors are enough
چکیده انگلیسی

An acyclic coloring of a graph G is a coloring of its vertices such that: (i) no two neighbors in G are assigned the same color and (ii) no bicolored cycle can exist in G. The acyclic chromatic number of G is the least number of colors necessary to acyclically color G. In this paper, we show that any graph of maximum degree 5 has acyclic chromatic number at most 9, and we give a linear time algorithm that achieves this bound.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 105, Issue 2, 16 January 2008, Pages 65-72