Online Graph Coloring
Online Graph Coloring is a computational problem in graph theory where vertices of a graph are revealed sequentially and must be irrevocably assigned colors from a fixed palette in real time, such that no two adjacent vertices share the same color, with the coloring decision constrained by the lack of knowledge about future vertices.
33
Publications
960
Citations
84
Authors
48
Institutions
Publications per year
2017–2026
1
Parents
33
A fast algorithm for equitable coloring
Henry A. Kiersteád, Alexandr Kostochka, Marcelo Mydlarz et al. · COMBINATORICA · 2010 · 88 citations
Randomized online graph coloring
Sundar Vishwanathan · Journal of Algorithms · 1992 · 55 citations
On dynamic coloring for planar graphs and graphs of higher genus
Ye Chen, Suohai Fan, Hong‐Jian Lai et al. · Discrete Applied Mathematics · 2012 · 48 citations
1–5 of 33
84
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 84
48

Tel Aviv University
Tel Aviv, Israel
5 h-index
9 publications
185 citations
ETH Zurich
Zurich, Switzerland
5 h-index
13 publications
314 citations
Ben-Gurion University of the Negev
Beersheba, Israel
4 h-index
6 publications
121 citations
Princeton University
Princeton, United States
2 h-index
2 publications
157 citations

Brooklyn College
Brooklyn, United States
2 h-index
2 publications
55 citations
Arizona State University
Tempe, United States
2 h-index
2 publications
223 citations
University of Chicago
Chicago, United States
2 h-index
2 publications
74 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
2 h-index
2 publications
223 citations
1–8 of 48
3 publications · 104 citations
3
h-index
3 publications · 86 citations
3
h-index
2 publications · 66 citations
2
h-index
2 publications · 38 citations
2
h-index
TALG · 2 publications · 49 citations
2
h-index
1–5