Every 4-regular graph is acyclically edge-6-colorable

Wang Weifan, Shu Qiaojun, Wang Yiqiao

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 $…