An improved bound on acyclic chromatic index of planar graphs

Proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by ${\chi }_a^{\mathrm{\prime }}(G)$, is the least number of colors $k$ such that $G$ has an acyclic edge $k$-coloring. Basavaraju et al. [Acyclic edge-coloring of planar graphs, SIAM J. Discrete Math. 25 (2) (2011), 463–478] showed that $\chi’_a(G)\le \Delta(G)+12$forplanargraphs$G$withmaximumdegree$\Delta(G)$. In this paper, the bound is improved to $\mathrm{\Delta }(G)+10$.