The edge Hamiltonian path problem is NP-complete (Q1169818)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The edge Hamiltonian path problem is NP-complete |
scientific article |
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
