✦ LIBER ✦

Linear 2-Arboricity of Planar Graphs with Neither 3-Cycles Nor Adjacent 4-Cycles

✍ Scribed by Hong-Xia Niu, Jian-Sheng Cai

Book ID: 120788674
Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 141 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1122-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar graphs with neither 5-cycles nor

Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable

✍ Oleg V. Borodin; Aleksei N. Glebov 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 561 KB

Planar graphs with cycles of length neit

Planar graphs with cycles of length neither 4 nor 7 are -colorable

✍ Li, Huihui; Xu, Jinghan; Wang, Yingqian 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 393 KB

The linear arboricity of planar graphs w

The linear arboricity of planar graphs with no short cycles

✍ Jian-Liang Wu; Jian-Feng Hou; Gui-Zhen Liu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Planar graphs without 4-cycles adjacent

Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable

✍ Oleg V. Borodin; Anna O. Ivanova 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

## Abstract It is known that not all planar graphs are 4‐choosable; neither all of them are vertex 2‐arborable. However, planar graphs without 4‐cycles and even those without 4‐cycles adjacent to 3‐cycles are known to be 4‐choosable. We extend this last result in terms of covering the vertices of a

The Linear Arboricity of Planar Graphs w

The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords

✍ Hongyu Chen, Xiang Tan, Jianliang Wu, Guojun Li 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 225 KB

Edge choosability and total choosability

Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles

✍ Rui Li; Baogang Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 218 KB