A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs

DOI10.1016/0012-365X(94)00002-ZzbMath0834.05033MaRDI QIDQ1896341

Ahmed Ainouche

Publication date: 5 February 1996

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

zbMATH Keywords

neighborhood unionneighborhood intersectionhamiltonian cyclehamiltonian graphshamiltonian path

Mathematics Subject Classification ID

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

Related Items (4)

The neighborhood union of independent sets and hamiltonicity of graphs ⋮ An extension of the Win theorem: counting the number of maximum independent sets ⋮ The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index ⋮ An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of the 0-dual closure for hamiltonian graphs
• Long cycles in graphs with large degree sums
• Four sufficient conditions for hamiltonian graphs
• Semi-independence number of a graph and the existence of Hamiltonian circuits
• A generalization of a result of Häggkvist and Nicoghossian
• Neighbourhood unions and Hamiltonian properties in graphs
• Hamiltonism, degree sum and neighborhood intersections
• Hamiltonian properties of graphs with large neighborhood unions
• A remark on two sufficient conditions for Hamilton cycles
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• A new sufficient condition for hamiltonian graphs
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Insertible vertices, neighborhood intersections, and hamiltonicity
• One sufficient condition for hamiltonian graphs
• Some Theorems on Abstract Graphs

This page was built for publication: A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs