Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path (Q2971135): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2569808087 / rank | |||
Normal rank | |||
Revision as of 22:31, 19 March 2024
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
