Acyclic edge coloring of graphs with max
β
Manu Basavaraju; L. Sunil Chandran
π
Article
π
2009
π
John Wiley and Sons
π
English
β 168 KB
π 1 views
## 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 is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__β²(__G__). It was conj