✦ LIBER ✦

Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4

✍ Scribed by Qiaojun Shu; Weifan Wang; Yiqiao Wang

Book ID: 112121144
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 656 KB
Volume: 73
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic chromatic indices of planar grap

Acyclic chromatic indices of planar graphs with girth at

✍ Qiaojun Shu; Weifan Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 654 KB

Acyclic chromatic indices of planar grap

Acyclic chromatic indices of planar graphs with large girth

✍ Weifan Wang; Qiaojun Shu; Kan Wang; Ping Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Group chromatic number of planar graphs

Group chromatic number of planar graphs of girth at least 4

✍ Hong-Jian Lai; Xiangwen Li 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB 👁 1 views

## Abstract Jeager et al. introduced a concept of group connectivity as a generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5‐edge connected graph is Z~3~‐connected. For planar graphs, this is equivalent to that every planar graph with girth at lea

On 3-choosable planar graphs of girth at

On 3-choosable planar graphs of girth at least 4

✍ Xiangwen Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs with large girth

✍ Dongxiao Yu; Jianfeng Hou; Guizhen Liu; Bin Liu; Lan Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 450 KB

A new upper bound on the acyclic chromat

A new upper bound on the acyclic chromatic indices of planar graphs

✍ Weifan Wang; Qiaojun Shu; Yiqiao Wang 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 358 KB