Semi-independence number of a graph and the existence of Hamiltonian circuits

DOI10.1016/0166-218X(87)90025-4zbMath0613.05037MaRDI QIDQ1088684

Ahmed Ainouche, Nicos Christofides

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cyclesclosuredegree conditionsneighbourhood

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Subgraphs, closures and hamiltonicity ⋮ A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ \(\alpha\)-degree closures for graphs ⋮ Computation of the 0-dual closure for hamiltonian graphs ⋮ \(\beta\)-neighborhood closures for graphs ⋮ \(\beta \)-degree closures for graphs ⋮ Dirac's type sufficient conditions for hamiltonicity and pancyclicity ⋮ A note on \(K_ 4\)-closures in hamiltonian graph theory ⋮ Four sufficient conditions for hamiltonian graphs ⋮ A closure concept based on neighborhood unions of independent triples

Cites Work

• Unnamed Item
• Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
• A method in graph theory
• A remark on two sufficient conditions for Hamilton cycles
• A note on Hamiltonian circuits
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees

This page was built for publication: Semi-independence number of a graph and the existence of Hamiltonian circuits