✦ LIBER ✦

Short encodings of planar graphs and maps

✍ Scribed by Kenneth Keeler; Jeffery Westbrook

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear-Time Succinct Encodings of Planar

✍ He, Xin; Kao, Ming-Yang; Lu, Hsueh-I 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 276 KB

Planar Graphs, via Well-Orderly Maps and

✍ Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Dominique Poulalhon; Gilles S 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 256 KB

Equitable colorings of planar graphs wit

✍ Nakprasit, Keaitsuda; Nakprasit, Kittikorn 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Edge choosability of planar graphs witho

✍ Weifan Wang 📂 Article 📅 2005 🏛 SP Science China Press 🌐 English ⚖ 263 KB

Short proofs of coloring theorems on pla

✍ Borodin, Oleg V.; Kostochka, Alexandr V.; Lidický, Bernard; Yancey, Matthew 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 373 KB

Adaptable choosability of planar graphs

✍ Albert Guan; Xuding Zhu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 370 KB