A sufficient condition for hamiltonian connectedness
From MaRDI portal
Publication:5588436
DOI10.1016/S0021-9800(70)80037-0zbMath0193.24401MaRDI QIDQ5588436
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (4)
Minimum degree ensuring that a hypergraph is Hamiltonian-connected ⋮ Degree sequence conditions for a graph to be disjoint path coverable ⋮ Panconnected graphs. II ⋮ On the extremal number of edges in Hamiltonian connected graphs
This page was built for publication: A sufficient condition for hamiltonian connectedness
