𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equitable Coloring of Sparse Planar Graphs

✍ Scribed by Luo, Rong; Sereni, Jean-Sébastien; Stephens, D. Christopher; Yu, Gexin


Book ID
118197070
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
219 KB
Volume
24
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Equitable -coloring of graphs
✍ Bor-Liang Chen; Chih-Hung Yen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 230 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
✍ 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