Acyclic edge coloring of triangle-free p
✍
Manu Basavaraju; L. Sunil Chandran
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 233 KB
👁 2 views
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 conjectured by Al