A new upper bound on the acyclic chromatic indices of planar graphs

Weifan Wang, Qiaojun Shu, Yiqiao Wang

An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index $a^{\prime }(G)$ of $G$ is the smallest integer $…