The Planar Hamiltonian Circuit Problem is NP-Complete (Q4115165): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 15:17, 5 March 2024
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
