Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms and almost tight results for 3-colorability of small diameter graphs |
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
23 March 2016
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
