✦ LIBER ✦

Acyclic edge coloring of planar graphs without 5-cycles

✍ Scribed by Qiaojun Shu; Weifan Wang; Yiqiao Wang

Book ID: 113564758
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 383 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.12.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs without cycles of

✍ Yunshu Gao; Dongxiao Yu 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 340 KB

Acyclic Edge Coloring of Planar Graphs W

Acyclic Edge Coloring of Planar Graphs Without Small Cycles

✍ Jianfeng Hou; Guizhen Liu; Jianliang Wu 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 205 KB

Acyclic 4-coloring of planar graphs with

Acyclic 4-coloring of planar graphs without 4- and 5-cycles

✍ O. V. Borodin 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 500 KB

On acyclic edge coloring of planar graph

On acyclic edge coloring of planar graphs without intersecting triangles

✍ Ping Sheng; Yingqian Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs with colors

✍ Dávid Hudák; František Kardoš; Borut Lužar; Roman Soták; Riste Škrekovski 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 469 KB

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