The Planar Hamiltonian Circuit Problem is NP-Complete (Q4115165)
From MaRDI portal
scientific article; zbMATH DE number 3539240
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Planar Hamiltonian Circuit Problem is NP-Complete |
scientific article; zbMATH DE number 3539240 |
Statements
The Planar Hamiltonian Circuit Problem is NP-Complete (English)
0 references
1976
0 references
