✦ LIBER ✦

Planar graphs without adjacent cycles of length at most seven are 3-colorable

✍ Scribed by Oleg V. Borodin; Mickael Montassier; André Raspaud

Book ID: 108114183
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 613 KB
Volume: 310
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.08.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar graphs without triangles adjacent

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable

✍ O.V. Borodin; A.N. Glebov; A. Raspaud 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 468 KB

On 3-colorability of planar graphs witho

On 3-colorability of planar graphs without adjacent short cycles

✍ YingQian Wang; XiangHua Mao; HuaJing Lu; WeiFan Wang 📂 Article 📅 2010 🏛 SP Science China Press 🌐 English ⚖ 141 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

Three coloring planar graphs without cyc

Three coloring planar graphs without cycles of length from 4 to 6 or seven cycles with close triangles

✍ Peter Whalen 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 183 KB

A note on the total coloring of planar g

A note on the total coloring of planar graphs without adjacent 4-cycles

✍ Hui-Juan Wang; Jian-Liang Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Acyclic 4-colorability of planar graphs

Acyclic 4-colorability of planar graphs without cycles of length 4 or 6

✍ O. V. Borodin 📂 Article 📅 2010 🏛 Pleiades Publishing 🌐 English ⚖ 423 KB