A remark on two sufficient conditions for Hamilton cycles
From MaRDI portal
Publication:1247337
DOI10.1016/0012-365X(78)90124-3zbMath0381.05040MaRDI QIDQ1247337
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Chvátal–Erdős Theorem: Old Theorem with New Aspects, Graph theory (algorithmic, algebraic, and metric problems), Degree conditions for Hamiltonicity: counting the number of missing edges, A degree sum condition concerning the connectivity and the independence number of a graph, Semi-independence number of a graph and the existence of Hamiltonian circuits, Circuits through specified edges, A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs, Extensions and consequences of Chvátal-Erdös' theorem, Circumferences of k-connected graphs involving independence numbers
Cites Work