Vertex Coloring
Vertex Coloring is a method in graph theory that assigns colors to the vertices of a graph such that no two adjacent vertices share the same color, thereby partitioning the vertex set into independent sets according to the coloring constraints.
1.2K
Publications
54.3K
Citations
1.7K
Authors
751
Institutions
Publications per year
2017–2026
162
Parents
1.2K
New methods to color the vertices of a graph
Daniel Brélaz · Communications of the ACM · 1979 · 1.6K citations · Full text
The NP-Completeness of Edge-Coloring
Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations
Using tabu search techniques for graph coloring
Alain Hertz, D. de Werra · Computing · 1987 · 660 citations · Full text
1–5 of 1.2K
1.7K
18
h-index
Laboratoire Bordelais de Recherche en Informatique, France
20 publications · 761 citations
16
h-index
13
h-index
University of Illinois Urbana-Champaign, United States
13 publications · 829 citations
13
h-index
13
h-index
1–5 of 1.7K
751
Laboratoire Bordelais de Recherche en Informatique
Talence, France
21 h-index
69 publications
2K citations
Université de Bordeaux
Bordeaux, France
21 h-index
69 publications
2K citations

Centre National de la Recherche Scientifique
Paris, France
21 h-index
80 publications
2.2K citations
Shandong University
Jinan, China
21 h-index
99 publications
2.7K citations

Tel Aviv University
Tel Aviv, Israel
20 h-index
35 publications
3K citations

Zhejiang Normal University
Jinhua, China
20 h-index
61 publications
1.7K citations
Institut Polytechnique de Bordeaux
Bordeaux, France
17 h-index
49 publications
1.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
16 h-index
28 publications
933 citations
1–8 of 751
143 publications · 5.5K citations
37
h-index
104 publications · 4.1K citations
32
h-index
63 publications · 3.5K citations
29
h-index
72 publications · 2.7K citations
29
h-index
41 publications · 1.5K citations
24
h-index
1–5