Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650386 | Discrete Mathematics | 2008 | 4 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Manu Basavaraju, L. Sunil Chandran,