Acyclic Edge Coloring of 3-sparse Graphs
This paper proves Fiamčík's conjecture that the acyclic chromatic index of a 3-sparse graph is at most , and further establishes a tighter bound of for such graphs containing an edge whose endpoints have a degree sum of at most , except for specific bipartite graphs where the bound remains .