The edge Hamiltonian path problem is NP-complete (Q1169818)
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 edge Hamiltonian path problem is NP-complete |
scientific article; zbMATH DE number 3780578
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The edge Hamiltonian path problem is NP-complete |
scientific article; zbMATH DE number 3780578 |
Statements
The edge Hamiltonian path problem is NP-complete (English)
0 references
1981
0 references
edge graph
0 references
cubic graph
0 references
NP-completeness
0 references
