𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equitable and proportional coloring of trees

✍ Scribed by Béla Bollobás; Richard K Guy

Book ID
103506062
Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
449 KB
Volume
34
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Equitable Coloring and the Maximum Degre
Equitable Coloring and the Maximum Degree
✍ Bor-Liang Chen; Ko-Wei Lih; Pou-Lin Wu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Let \(\Delta(G)\) denote the maximum degree of a graph \(G\). The equitable \(\Delta\)-coloring conjecture asserts that a connected graph \(G\) is equitably \(\Delta(G)\)-colorable if it is different from \(K_{m}, C_{2 m+1}\) and \(K_{2 m+1,2 m+1}\) for all \(m \geqslant 1\). This conjecture is esta

Equitable total coloring ofFn⋁Wn
Equitable total coloring ofFn⋁Wn
✍ Kun Gong; Zhong-fu Zhang; Jian-fang Wang 📂 Article 📅 2008 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 149 KB