University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 6 1 2015 03 01 A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures 51 61 9056 10.22052/ijmc.2015.9056 EN I. Rajasingh School of Advanced Sciences, VIT University, Chennai-600127, India R. Rajan School of Advanced Sciences, VIT University, Chennai-600127, India D. Paul School of Advanced Sciences, VIT University, Chennai-600127, India Journal Article 2015 01 07 An 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