Emergent Mind
Further result on acyclic chromatic index of planar graphs
(1405.0713)
Published May 4, 2014
in
math.CO
and
cs.DM
Abstract
An acyclic edge coloring of a graph $G$ is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index $\chiup{a}'(G)$ of a graph $G$ is the least number of colors in an acyclic edge coloring of $G$. It was conjectured that $\chiup'{a}(G)\leq \Delta(G) + 2$ for any simple graph $G$ with maximum degree $\Delta(G)$. In this paper, we prove that every planar graph $G$ admits an acyclic edge coloring with $\Delta(G) + 6$ colors.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.