✦ LIBER ✦

On acyclic edge coloring of planar graphs without intersecting triangles

✍ Scribed by Ping Sheng; Yingqian Wang

Book ID: 113567392
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 219 KB
Volume: 311
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.07.023

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

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 5-cycles

✍ Qiaojun Shu; Weifan Wang; Yiqiao Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 383 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

Choosability and Edge Choosability of Pl

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

✍ Wang, Wei-Fan; Lih, Ko-Wei 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 140 KB

On edge colorings of 1-planar graphs wit

On edge colorings of 1-planar graphs without adjacent triangles

✍ Xin Zhang; Guizhen Liu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 140 KB