Back to Search
Start Over
Acyclic edge coloring of planar graphs with large girth
- Source :
-
Theoretical Computer Science . Nov2009, Vol. 410 Issue 47-49, p5196-5200. 5p. - Publication Year :
- 2009
-
Abstract
- Abstract: Acyclic coloring problem is a specialized problem that arises in the efficient computation of Hessians. A proper edge coloring of a graph is called acyclic if there is no -colored cycle in . The acyclic edge chromatic number of is the least number of colors in an acyclic edge coloring of . Alon et al. conjectured that . In this paper, we consider the sufficient conditions for the planar graphs satisfying and . [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 410
- Issue :
- 47-49
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 44584581
- Full Text :
- https://doi.org/10.1016/j.tcs.2009.08.015