A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures
Indra Rajasingh, R. Sundara Rajan, Daniel Paul · Iranian journal of mathemathical chemistry./Iranian journal of mathemathical chemistry · 2015
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 ) ( ' G a is the minimum number k such that there is an acyclic edge coloring using k colors. The maximum degree in G denoted by ∆(G), is the lower bound for ) ( ' G a . Pcuts introduced in this paper