Exact Graph Coloring is a computational method in graph theory that belongs to the class of graph coloring algorithms, distinguished by its objective of determining the minimum number of colors required to color the vertices of a graph such that no two adjacent vertices share the same color, while guaranteeing an optimal solution.
42
Publications
3.6K
Citations
93
Authors
59
Institutions
Publications per year
2017–2026
6
Variants
Optimal Graph Coloring
Parents
Publications
42
New methods to color the vertices of a graph
Daniel Brélaz · Communications of the ACM · 1979 · 1.6K citations · Full text
An exact approach for the Vertex Coloring Problem
Enrico Malaguti, Michele Monaci, Paolo Toth · Discrete Optimization · 2010 · 121 citations
1–5 of 42
Authors
93
- IH
4
h-index
- RA
4
h-index
- DD
4
h-index
- FA
2
h-index
- MP
2
h-index
1–5 of 93
Institutions
59
Universitas Jember
Jember, Indonesia
4 h-index
19 publications
273 citations
University of Michigan
Ann Arbor, United States
3 h-index
7 publications
169 citations
Centre for Automation and Robotics
Arganda, Spain
2 h-index
3 publications
140 citations
University of Bologna
Bologna, Italy
2 h-index
3 publications
260 citations
Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
54 citations
University of Belgrade
Belgrade, Serbia
2 h-index
5 publications
179 citations
American University in Dubai
Dubai, United Arab Emirates
2 h-index
2 publications
29 citations
Synopsys (United States)
Mountain View, United States
2 h-index
2 publications
80 citations
1–8 of 59
Venues
- Computers & Operations Research
5 publications · 186 citations
5
h-index
- Journal of Physics Conference Series
3 publications · 44 citations
3
h-index
- Communications of the ACM
2 publications · 1.6K citations
2
h-index
- Information Processing Letters
2 publications · 252 citations
2
h-index
- European Journal of Operational Research
2 publications · 77 citations
2
h-index
1–5