✦ LIBER ✦

The 3-Colorability Problem on Graphs with Maximum Degree Four

✍ Scribed by Kochol, Martin; Lozin, Vadim; Randerath, Bert

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equitable Total Coloring of Graphs with

✍ Wei-Fan Wang 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 120 KB

On the 7 Total Colorability of Planar Gr

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

On the 9-total-colorability of planar gr

✍ Lan Shen; Yingqian Wang; Weifan Wang; Ko-Wei Lih 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 638 KB

On the size of edge-coloring critical gr

✍ Lianying Miao; Shiyou Pang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Plane Graphs with Maximum Degree Δ≥8 Are

✍ Yingqian Wang; Xianghua Mao; Zhengke Miao 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 567 KB

On the maximum disjoint paths problem on

✍ Bang Ye Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 298 KB