✦ LIBER ✦

Planar graphs without cycles of length 4 or 5 are -colorable

✍ Scribed by Hill, Owen; Smith, Diana; Wang, Yingqian; Xu, Lingji; Yu, Gexin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

-colorability of planar graphs without c

✍ Wang, Yingqian; Yang, Yaochou 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Planar graphs without adjacent cycles of

✍ Oleg V. Borodin; Mickael Montassier; André Raspaud 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 613 KB

Planar graphs with cycles of length neit

✍ Li, Huihui; Xu, Jinghan; Wang, Yingqian 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Planar graphs with cycles of length neit

✍ Wang, Yingqian; Xu, Jinghan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Planar graphs without triangles adjacent

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

Acyclic 4-colorability of planar graphs

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