The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs (Q3031944): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56138404, #quickstatements; #temporary_batch_1711234560214 |
||
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