Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Every planar map is four colorable. I: Discharging / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: `` Strong '' NP-Completeness Results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Natural Self-Reducible Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Computational Complexity of Tutte Invariants for Planar Graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(91)90081-c / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087358907 / rank | |||
Normal rank | |||
Latest revision as of 10:17, 30 July 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
