Back to Search
Start Over
Acyclic edge coloring of planar graphs with girth at least 5.
- Source :
-
Discrete Applied Mathematics . Dec2013, Vol. 161 Issue 18, p2958-2967. 10p. - Publication Year :
- 2013
-
Abstract
- Abstract: A proper edge coloring of a graph is if there is no bichromatic cycle in . The acyclic chromatic index of , denoted , is the least number of colors such that has an acyclic -edge-coloring. In this paper, it is shown that if is a planar graph with girth at least 5 and maximum degree , then . Moreover, if , then . [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 161
- Issue :
- 18
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 91952459
- Full Text :
- https://doi.org/10.1016/j.dam.2013.06.013