Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
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