𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acyclic edge coloring of planar graphs with colors

✍ Scribed by Dávid Hudák; František Kardoš; Borut Lužar; Roman Soták; Riste Škrekovski

Book ID
113564783
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
469 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge coloring of triangle-free p
Acyclic edge coloring of triangle-free planar graphs
✍ 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