Back to Search
Start Over
Acyclic edge coloring of subcubic graphs
- Source :
-
Discrete Mathematics . Dec2008, Vol. 308 Issue 24, p6650-6653. 4p. - Publication Year :
- 2008
-
Abstract
- 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 such that there is an acyclic edge coloring using colors and it is denoted by . 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. [Copyright &y& Elsevier]
- Subjects :
- *GRAPH coloring
*MATHEMATICAL analysis
*GRAPHIC methods
*GRAPH theory
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 308
- Issue :
- 24
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 35073965
- Full Text :
- https://doi.org/10.1016/j.disc.2007.12.036