Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graph coloring is not self-reducible, assuming P\(\neq NP\) |
scientific article |
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
