| Acyclic Edge Coloring of Planar Graphs without Adjacent Triangles |
| Received:July 07, 2010 Revised:December 19, 2011 |
| Key Words:
acyclic edge coloring acyclic edge chromatic number planar graph.
|
| Fund Project: |
|
| Hits: 2967 |
| Download times: 2608 |
| Abstract: |
| An acyclic edge coloring of a graph $G$ is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic edge chromatic number} of a graph $G$ is the minimum number $k$ such that there exists an acyclic edge coloring using $k$ colors and is denoted by $\chi'_{a}(G)$. In this paper we prove that $\chi'_{a}(G)\leq \Delta(G)+5$ for planar graphs $G$ without adjacent triangles. |
| Citation: |
| DOI:10.3770/j.issn:2095-2651.2012.04.004 |
| View Full Text View/Add Comment |
