A sufficient condition for Hamiltonian circuits
From MaRDI portal
Publication:1223311
DOI10.1016/0095-8956(78)90037-0zbMath0322.05126MaRDI QIDQ1223311
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(78)90037-0
05C35: Extremal problems in graph theory
Related Items
Best monotone degree conditions for graph properties: a survey, Best monotone degree conditions for binding number and cycle structure, Graph theory (algorithmic, algebraic, and metric problems), Best monotone degree conditions for binding number, Compatible Hamilton cycles in Dirac graphs, Triangles and neighbourhoods of independent sets in graphs, Binding Number, Minimum Degree, and Cycle Structure in Graphs, Some recent results in hamiltonian graphs
Cites Work