On the Hardness of 4-Coloring a 3-Colorable Graph (Q4652619): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:47, 7 February 2024
scientific article; zbMATH DE number 2139161
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hardness of 4-Coloring a 3-Colorable Graph |
scientific article; zbMATH DE number 2139161 |
Statements
On the Hardness of 4-Coloring a 3-Colorable Graph (English)
0 references
28 February 2005
0 references
graph coloring
0 references
PCP theorem
0 references
NP-hardness
0 references
hardness of approximation
0 references
