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.
Rajasingh,I , Rajan,R and Paul,D . (2015). A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures. Iranian Journal of Mathematical Chemistry, 6(1), 51-61. doi: 10.22052/ijmc.2015.9056
MLA
Rajasingh,I , , Rajan,R , and Paul,D . "A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures", Iranian Journal of Mathematical Chemistry, 6, 1, 2015, 51-61. doi: 10.22052/ijmc.2015.9056
HARVARD
Rajasingh I, Rajan R, Paul D. (2015). 'A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures', Iranian Journal of Mathematical Chemistry, 6(1), pp. 51-61. doi: 10.22052/ijmc.2015.9056
CHICAGO
I Rajasingh, R Rajan and D Paul, "A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures," Iranian Journal of Mathematical Chemistry, 6 1 (2015): 51-61, doi: 10.22052/ijmc.2015.9056
VANCOUVER
Rajasingh I, Rajan R, Paul D. A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures. Iranian J. Math. Chem.. 2015;6(1):51-61. doi: 10.22052/ijmc.2015.9056
