𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equitable total coloring ofFn⋁Wn

✍ Scribed by Kun Gong; Zhong-fu Zhang; Jian-fang Wang

Book ID
106301212
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2008
Tongue
English
Weight
149 KB
Volume
25
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equitable -coloring of graphs
Equitable -coloring of graphs
✍ Bor-Liang Chen; Chih-Hung Yen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 230 KB
Equitable Coloring of Trees
Equitable Coloring of Trees
✍ B.L. Chen; K.W. Lih 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 224 KB

A graph is equitably \(k\)-colorable if its vertices can be partitioned into \(k\) independent sets of as near equal sizes as possible. Regarding a non-null tree \(T\) as a bipartite graph \(T(X, Y)\), we show that \(T\) is equitably \(k\)-colorable if and only if (i) \(k \geqslant 2\) when ||\(X|-|

Equitable list coloring and treewidth
Equitable list coloring and treewidth
✍ Michael J. Pelsmajer 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 143 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 mo