Acyclic chromatic indices of K4-minor free graphs
Weifan Wang, Qiaojun Shu · Scientia Sinica Mathematica · 2011
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′(G) of G is the smallest integer k such that G has an acyclic edge coloring using k colors. In this paper, we determine completely the acyclic chromatic indices of K4-minor free graphs with maximum degree not equal to 4.