✦ LIBER ✦

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

✍ Scribed by Oleg V. Borodin; Aleksei N. Glebov

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 561 KB
Volume: 66
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20486

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On 3-colorable planar graphs without sho

On 3-colorable planar graphs without short cycles

✍ Min Chen; Weifan Wang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 198 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