On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors (Q3588404): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_11 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1539723571 / rank | |||
Normal rank | |||
Latest revision as of 19:13, 19 March 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
