On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors (Q3588404): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:13, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors |
scientific article |
Statements
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors (English)
0 references
10 September 2010
0 references
hardness of approximation
0 references
graph coloring
0 references
majority is stablest
0 references
