✦ LIBER ✦

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

✍ Scribed by Gerard J. Chang; Nicolas Roussel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Three coloring planar graphs without cyc

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

Edge choosability and total choosability

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

Acyclic 3-choosability of planar graphs

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

Planar graphs without triangles adjacent

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

[Algorithms and Combinatorics] Topics in

✍ Klazar, Martin; Kratochvíl, Jan; Loebl, Martin; Matoušek, Jiří; Valtr, Pavel; Th 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg ⚖ 557 KB

On the 7 Total Colorability of Planar Gr

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