Abstract
An acyclic edge-coloring of a graph $G$ is a proper edge-coloring of $G$ such that the subgraph induced by any two color classes is acyclic. The acyclic chromatic index, $\chi'_a(G)$, is the smalle...
Submitted Version (Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have