✦ LIBER ✦

Equitable defective coloring of sparse planar graphs

✍ Scribed by Lee Williams; Jennifer Vandenbussche; Gexin Yu

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equitable Coloring of Sparse Planar Grap

Equitable Coloring of Sparse Planar Graphs

✍ Luo, Rong; Sereni, Jean-Sébastien; Stephens, D. Christopher; Yu, Gexin 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 219 KB

Equitable -coloring of graphs

✍ Bor-Liang Chen; Chih-Hung Yen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Equitable colorings of planar graphs wit

Equitable colorings of planar graphs without short cycles

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

-coloring of sparse graphs

✍ O.V. Borodin; A.O. Ivanova; M. Montassier; A. Raspaud 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 262 KB

-coloring of sparse graphs

✍ O.V. Borodin; A.O. Ivanova; M. Montassier; A. Raspaud 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 238 KB

On equitable coloring of bipartite graph

On equitable coloring of bipartite graphs

✍ Ko-Wei Lih; Pou-Lin Wu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 285 KB

If the vertices of a graph G are partitioned into k classes V~, I/2 ..... Vk such that each V~ is an independent set and I1V~I-IV~[I ~< 1 for all i#j, then G is said to be equitably colored with k colors. The smallest integer n for which G can be equitably colored with n colors is called the equitab