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

DOI10.1016/0012-365X(94)00002-ZMaRDI QIDQ1896341zbMATH OpenFDO

Authors Ahmed Ainouche

Publication date 5 February 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(94)00002-Z

zbMATH Keywords

hamiltonian cyclehamiltonian graphshamiltonian pathneighborhood intersectionneighborhood union

Mathematics Subject Classification ID

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

Recommendations

• An improvement of fraisse's sufficient condition for hamiltonian graphs
• scientific article; zbMATH DE number 1109411
• scientific article; zbMATH DE number 123903
• A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs
• A new sufficient condition for hamiltonian graphs

Cites work

• A generalization of a result of Häggkvist and Nicoghossian
• A new sufficient condition for hamiltonian graphs
• A note on Hamiltonian circuits
• A remark on two sufficient conditions for Hamilton cycles
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Computation of the 0-dual closure for hamiltonian graphs
• Four sufficient conditions for hamiltonian graphs
• Hamiltonian properties of graphs with large neighborhood unions
• Hamiltonism, degree sum and neighborhood intersections
• scientific article; zbMATH DE number 4134087 (Why is no real title available?)
• scientific article; zbMATH DE number 4142080 (Why is no real title available?)
• scientific article; zbMATH DE number 4164899 (Why is no real title available?)
• Insertible vertices, neighborhood intersections, and hamiltonicity
• Long cycles in graphs with large degree sums
• Neighbourhood unions and Hamiltonian properties in graphs
• Note on Hamilton Circuits
• One sufficient condition for hamiltonian graphs
• Semi-independence number of a graph and the existence of Hamiltonian circuits
• Some Theorems on Abstract Graphs

Cited in

(9)

• An extension of the Win theorem: counting the number of maximum independent sets
• An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets
• The neighborhood union of independent sets and hamiltonicity of graphs
• scientific article; zbMATH DE number 4164899 (Why is no real title available?)
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• scientific article; zbMATH DE number 123903 (Why is no real title available?)
• scientific article; zbMATH DE number 1109394 (Why is no real title available?)
• Insertible vertices, neighborhood intersections, and hamiltonicity
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896341)