✦ LIBER ✦

Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords

✍ Scribed by Chang, Jian; Wang, Hui-Juan; Wu, Jian-Liang; A, Yong-Ga

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge colorings of planar graphs without

✍ Wu, Jian-Liang; Xue, Ling 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Planar graphs with maximum degree 7 and

✍ Lan Shen; Yingqian Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 460 KB

Edge Colorings of Planar Graphs without

✍ Xue, Ling; Wu, Jianliang 📂 Article 📅 2013 🏛 Scientific Research Publishing ⚖ 133 KB

Total coloring of planar graphs with max

✍ Wang, Huijuan; Wu, Lidong; Wu, Jianliang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Total colorings of planar graphs with ma

✍ Lan Shen; YingQian Wang 📂 Article 📅 2009 🏛 SP Science China Press 🌐 English ⚖ 319 KB

Total colorings of planar graphs with la

✍ Borodin, O. V.; Kostochka, A. V.; Woodall, D. R. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 3 views

It is proved that a planar graph with maximum degree ∆ ≥ 11 has total (vertex-edge) chromatic number ∆ + 1.