Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4204366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graph coloring is not self-reducible, assuming P\(\neq NP\) |
scientific article; zbMATH DE number 4204366 |
Statements
Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (English)
0 references
1991
0 references
NP-hard
0 references
planar graph four-coloring
0 references
0.9166678786277772
0 references
0.7868324518203735
0 references
0.7846083045005798
0 references
0.7772819399833679
0 references
