Abstract
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
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
