%0 Journal Article
%T A new approach to compute acyclic chromatic index of certain chemical structures
%J Iranian Journal of Mathematical Chemistry
%I University of Kashan
%Z 2228-6489
%A Rajasingh, I.
%A Rajan, R.
%A Paul, D.
%D 2015
%\ 03/01/2015
%V 6
%N 1
%P 51-61
%! A new approach to compute acyclic chromatic index of certain chemical structures
%K Acyclic edge-coloring
%K Acyclic chromatic index
%K Maximum degree
%K Certain chemical structures
%R 10.22052/ijmc.2015.9056
%X 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.
%U http://ijmc.kashanu.ac.ir/article_9056_8441113ee648b7051f3b05875d262234.pdf