✦ LIBER ✦

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

✍ Scribed by Peter Whalen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

()-total choosability of planar graphs w

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

Acyclic 4-colorability of planar graphs

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

Planar graphs without triangles adjacent

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

Acyclic 3-choosability of planar graphs

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

On the 7 Total Colorability of Planar Gr

✍ Lan Shen; Yingqian Wang 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 168 KB