The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs (Q3031944): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 23:52, 19 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
