University of KashanIranian Journal of Mathematical Chemistry2228-64896120150301A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures5161905610.22052/ijmc.2015.9056ENI.RajasinghSchool of Advanced Sciences, VIT University, Chennai-600127, IndiaR.RajanSchool of Advanced Sciences, VIT University, Chennai-600127, India0000-0002-1851-6334D.PaulSchool of Advanced Sciences, VIT University, Chennai-600127, IndiaJournal Article20150107An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerful tool to prove that this bound is sharp for certain chemical structures.https://ijmc.kashanu.ac.ir/article_9056_8441113ee648b7051f3b05875d262234.pdf