The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two (Q1254855)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two |
scientific article; zbMATH DE number 3621142
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two |
scientific article; zbMATH DE number 3621142 |
Statements
The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two (English)
0 references
1979
0 references
Hamiltonian Cycle Problem in Planar Digraphs
0 references
Np-Completeness
0 references
0 references
