Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
From MaRDI portal
Publication:3731630
DOI10.1112/jlms/s2-32.3.385zbMath0598.05045OpenAlexW2030103955MaRDI QIDQ3731630
Ahmed Ainouche, Nicos Christofides
Publication date: 1985
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-32.3.385
Related Items
Semi-independence number of a graph and the existence of Hamiltonian circuits ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ A Remark on Hamiltonian Cycles ⋮ Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A simple proof of a theorem of Jung ⋮ Cycles through given vertices and closures ⋮ Characterizing degree-sum maximal nonhamiltonian bipartite graphs ⋮ Fan type condition and characterization of Hamiltonian graphs ⋮ Toughness in graphs -- a survey ⋮ Long cycles in graphs with large degree sums ⋮ On the size of maximally non-hamiltonian digraphs ⋮ An Ore-type condition for the existence of two disjoint cycles ⋮ On the length of longest dominating cycles in graphs ⋮ A degree characterisation of pancyclicity
