Tight bounds for online coloring of basic graph classes (Q2223701)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7303851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for online coloring of basic graph classes |
scientific article; zbMATH DE number 7303851 |
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
0.9993658661842346
0 references
0.8816295266151428
0 references
0.869029700756073
0 references
0.8681117296218872
0 references
