The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two (Q1254855)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two |
scientific article |
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
