Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs

Nevil Anto, Manu Basavaraju, Suresh Manjanath Hegde +1

An acyclic edge coloring of a graph is a proper edge coloring without any bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $a^{\prime }(G)$, is the minimum $k$ such…