𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equitable -coloring of graphs

✍ Scribed by Bor-Liang Chen; Chih-Hung Yen

Book ID
113567331
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
230 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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
On Equitable Coloring of d -Degenerate G
On Equitable Coloring of d -Degenerate Graphs
✍ Kostochka, A. V.; Nakprasit, K.; Pemmaraju, S. V. πŸ“‚ Article πŸ“… 2005 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 191 KB
A note on relaxed equitable coloring of
A note on relaxed equitable coloring of graphs
✍ Hao Fan; H.A. Kierstead; Guizhen Liu; Theodore Molla; Jian-Liang Wu; Xin Zhang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 401 KB
Equitable edge-colorings of simple graph
Equitable edge-colorings of simple graphs
✍ Xia Zhang; Guizhen Liu πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 199 KB

An edge-coloring of a graph G is equitable if, for each v ∈ V (G), the number of edges colored with any one color incident with v differs from the number of edges colored with any other color incident with v by at most one. A new sufficient condition for equitable edge-colorings of simple graphs is