✦ LIBER ✦

On linear-time algorithms for five-coloring planar graphs

✍ Scribed by Greg N. Frederickson

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Linear-Time Algorithms for Edge-Colo

✍ Richard Cole; Łukasz Kowalik 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 457 KB

Fast algorithms for edge-coloring planar

✍ Marek Chrobak; Moti Yung 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 963 KB

Improved edge-coloring algorithms for pl

✍ Marek Chrobak; Takao Nishizeki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 808 KB

A linear 5-coloring algorithm of planar

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 526 KB

A result on linear coloring of planar gr

✍ Chunli Cai; Dezheng Xie; Wenjuan Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 170 KB

New upper bounds on linear coloring of p

✍ Bin Liu, Gui Zhen Liu 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 199 KB