Variations on a sufficient condition for Hamiltonian graphs

DOI10.7151/DMGT.1357MaRDI QIDQ5443837zbMATH OpenOpenAlexFDO

Authors Ahmed Ainouche, Serge Lapiquonne

Publication date 22 February 2008

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3fc42c7a7c37e485fb9083d336aaa9e43b845947

zbMATH Keywords

cyclesindependent setsdual closurepartially square graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• A note on a sufficient condition for Hamilton graphs
• Extension of several sufficient conditions for Hamiltonian graphs
• scientific article; zbMATH DE number 4134087
• scientific article; zbMATH DE number 811601
• scientific article; zbMATH DE number 1824151
• A sufficient condition for Hamilton graphs
• A sufficient condition for Hamilton graphs
• scientific article; zbMATH DE number 1501699
• A new sufficient condition for Hamiltonian graphs
• A new sufficient condition for hamiltonian graphs

Cited in

(5)

• Computation of the 0-dual closure for hamiltonian graphs
• scientific article; zbMATH DE number 4075117 (Why is no real title available?)
• scientific article; zbMATH DE number 4073021 (Why is no real title available?)
• A comparison of some conditions for non-hamiltonicity of graphs
• A clique-covering sufficient condition for hamiltonicity of graphs

This page was built for publication: Variations on a sufficient condition for Hamiltonian graphs

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