Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (Q2927657)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs |
scientific article |
Statements
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (English)
0 references
4 November 2014
0 references
3-coloring
0 references
graph diameter
0 references
graph radius
0 references
subexponential algorithm
0 references
NP-complete
0 references
exponential time hypothesis
0 references
