An improved bound on acyclic chromatic index of planar graphs

Yue Guan, Jianfeng Hou, Yingyuan Yang

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^{\prime }(G)$, is the least number of colo…