Tight bounds for online coloring of basic graph classes (Q2223701)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds for online coloring of basic graph classes |
scientific article |
Statements
Tight bounds for online coloring of basic graph classes (English)
0 references
1 February 2021
0 references
graph coloring
0 references
online algorithms
0 references
lower bounds
0 references
randomization
0 references
