𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acyclic Vertex Coloring of Graphs of Maximum Degree Six

✍ Scribed by Satish Varagani; V.Ch. Venkaiah; Kishore Yadav; Kishore Kothapalli


Book ID
108120741
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
187 KB
Volume
35
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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