✦ LIBER ✦

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

✍ Scribed by O.V. Borodin; A.N. Glebov; A. Raspaud

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar graphs without adjacent cycles of

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

✍ Oleg V. Borodin; Mickael Montassier; André Raspaud 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 613 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

()-total choosability of planar graphs w

()-total choosability of planar graphs with no cycles of length from 4 to and without close triangles

✍ Gerard J. Chang; Nicolas Roussel 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Acyclic 3-choosability of planar graphs

Acyclic 3-choosability of planar graphs without cycles of length from 4 to 12

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

Structural properties of plane graphs wi

Structural properties of plane graphs without adjacent triangles and an application to 3-colorings

✍ O. V. Borodin 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB 👁 1 views

If in a plane graph with minimum degree 2 3 no t w o triangles have an edge in common, then: (1 there are two adjacent vertices with degree sum at most 9, and (2) there is a face of size between 4 and 9 or a 10-face incident with ten 3-vertices. It follows that every planar graph without cycles betw