Equitable Coloring
Equitable Coloring is a proper vertex coloring of a graph in which the sizes of any two color classes differ by at most one, ensuring an approximately equal distribution of colors across the vertex set.
64
Publications
1.9K
Citations
86
Authors
68
Institutions
Publications per year
2017–2026
5
Parents
64
Equitable Coloring and the Maximum Degree
Bor-Liang Chen, Ko‐Wei Lih, Pou-Lin Wu · European Journal of Combinatorics · 1994 · 134 citations
On equitable coloring of bipartite graphs
Ko‐Wei Lih, Pou-Lin Wu · Discrete Mathematics · 1996 · 99 citations
A fast algorithm for equitable coloring
Henry A. Kiersteád, Alexandr Kostochka, Marcelo Mydlarz et al. · COMBINATORICA · 2010 · 88 citations
Bor‐Liang Chen, Ko‐Wei Lih · Journal of Combinatorial Theory Series B · 1994 · 87 citations
1–5 of 64
86
University of Illinois Urbana-Champaign, United States
11 publications · 526 citations
11
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 86
68
University of Illinois Urbana-Champaign
Urbana, United States
10 h-index
12 publications
585 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
8 h-index
9 publications
365 citations
Arizona State University
Tempe, United States
7 h-index
8 publications
393 citations

Zhejiang Normal University
Jinhua, China
5 h-index
5 publications
129 citations
Shandong University
Jinan, China
4 h-index
8 publications
162 citations

National Taiwan University
Taipei, Taiwan
3 h-index
5 publications
80 citations

Institut Universitaire de France
Paris, France
3 h-index
3 publications
46 citations
University of Gdańsk
Gdansk, Poland
3 h-index
4 publications
65 citations
1–8 of 68
9 publications · 327 citations
9
h-index
7 publications · 110 citations
7
h-index
7 publications · 163 citations
7
h-index
5 publications · 170 citations
5
h-index
3 publications · 64 citations
3
h-index
1–5