The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs (Q3031944): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:37, 3 February 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
