Graph Coloring
Graph Coloring is a combinatorial optimization problem in which the vertices of a graph are assigned colors such that no two adjacent vertices share the same color, distinguishing it from related graph partitioning problems by its focus on minimizing the number of colors used.
4.8K
Publications
212.3K
Citations
5.4K
Authors
1.7K
Institutions
Publications per year
2017–2026
592
4.8K
Fred Glover · INFORMS Journal on Computing · 1989 · 5K citations
New methods to color the vertices of a graph
Daniel Brélaz · Communications of the ACM · 1979 · 1.6K citations · Full text
Frequency assignment: Theory and applications
William K. Hale · Proceedings of the IEEE · 1980 · 1.3K citations
Choice Reviews Online · 1995 · 1.3K citations
A new method for solving hard satisfiability problems
Bart Selman, Hector J. Levesque, David G. M. Mitchell · 1992 · 1.2K citations
1–5 of 4.8K
5.4K
University of Illinois Urbana-Champaign, United States
70 publications · 3K citations
30
h-index
30
h-index
27
h-index
27
h-index
24
h-index
1–5 of 5.4K
1.7K

Tel Aviv University
Tel Aviv, Israel
43 h-index
148 publications
13.1K citations

Centre National de la Recherche Scientifique
Paris, France
38 h-index
293 publications
9.7K citations

Hungarian Academy of Sciences
Budapest, Hungary
38 h-index
186 publications
8.9K citations
Massachusetts Institute of Technology
Cambridge, United States
35 h-index
88 publications
10.5K citations
Charles University
Prague, Czechia
34 h-index
121 publications
4.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
33 h-index
156 publications
4.5K citations
Princeton University
Princeton, United States
33 h-index
90 publications
4.9K citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
30 h-index
153 publications
4.8K citations
1–8 of 1.7K
479 publications · 15.5K citations
59
h-index
225 publications · 12K citations
57
h-index
317 publications · 10.8K citations
47
h-index
228 publications · 7.6K citations
45
h-index
98 publications · 6.3K citations
41
h-index
1–5