Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path (Q2971135)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path |
scientific article |
Statements
Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path (English)
0 references
4 April 2017
0 references
combinatorial problems
0 references
connected graphs
0 references
Hamiltonian path
0 references
degree
0 references
