The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs (Q3031944): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56138404, #quickstatements; #temporary_batch_1711234560214 |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Takao Nishizeki / rank | |||
| Property / author | |||
| Property / author: Takao Nishizeki / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(89)90012-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983755786 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56138404 / rank | |||
Normal rank | |||
Latest revision as of 01:53, 24 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs |
scientific article |
Statements
The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs (English)
0 references
1989
0 references
Hamiltonian cycle problem
0 references
NP-completeness
0 references
