Coloring Sparse Graphs
Coloring Sparse Graphs is a research framework in graph theory that focuses on the development and analysis of algorithms for assigning colors to the vertices of sparse graphs such that adjacent vertices receive different colors, with emphasis on optimizing chromatic number and computational efficiency under structural sparsity constraints.
120
Publications
7.2K
Citations
240
Authors
146
Institutions
Publications per year
2017–2026
29
Parents
120
Choice Reviews Online · 1995 · 1.3K citations
Phase transitions in the coloring of random graphs
Lenka Zdeborová, Florent Krząkała · Physical Review E · 2007 · 305 citations · Full text
1–5 of 120
240
7
h-index
7
h-index
University of Illinois Urbana-Champaign, United States
7 publications · 162 citations
7
h-index
Laboratoire Bordelais de Recherche en Informatique, France
6 publications · 124 citations
6
h-index
6
h-index
1–5 of 240
146
Université de Bordeaux
Bordeaux, France
10 h-index
17 publications
359 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
18 publications
911 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
9 h-index
17 publications
359 citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
12 publications
272 citations
Institut Polytechnique de Bordeaux
Bordeaux, France
8 h-index
14 publications
274 citations

Zhejiang Normal University
Jinhua, China
7 h-index
13 publications
280 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
6 h-index
8 publications
220 citations

Université d'Angers
Angers, France
5 h-index
13 publications
559 citations
1–8 of 146
11 publications · 226 citations
10
h-index
8 publications · 141 citations
8
h-index
7 publications · 184 citations
7
h-index
6 publications · 339 citations
6
h-index
4 publications · 91 citations
4
h-index
1–5