✦ LIBER ✦

Equitable colorings of planar graphs with maximum degree at least nine

✍ Scribed by Kittikorn Nakprasit

Book ID: 113567506
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 215 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.11.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Total colorings of planar graphs with ma

Total colorings of planar graphs with maximum degree at least 8

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

Total colorings of planar graphs with la

Total colorings of planar graphs with large maximum degree

✍ 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.

Equitable Total Coloring of Graphs with

Equitable Total Coloring of Graphs with Maximum Degree 3

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

Equitable list-coloring for graphs of ma

Equitable list-coloring for graphs of maximum degree 3

✍ Michael J. Pelsmajer 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract Given lists of available colors assigned to the vertices of a graph __G__, a list coloring is a proper coloring of __G__ such that the color on each vertex is chosen from its list. If the lists all have size __k__, then a list coloring is equitable if each color appears on at most ⌈|__V

The linear arboricity of planar graphs w

The linear arboricity of planar graphs with maximum degree at least 5

✍ Hong-Yu Chen; Jian-Ming Qi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Total coloring of planar graphs with max

Total coloring of planar graphs with maximum degree 8

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