A clique-covering sufficient condition for hamiltonicity of graphs

DOI10.1016/J.IPL.2009.07.015zbMATH Open1197.05083OpenAlexW2041541789MaRDI QIDQ990948FDOQ990948

Alain Bretto, Thierry Vallée

Publication date: 1 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.07.015

Recommendations

• scientific article; zbMATH DE number 4123770
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs
• scientific article; zbMATH DE number 3867374
• Variations on a sufficient condition for Hamiltonian graphs
• A sufficient condition for Hamilton graphs

zbMATH Keywords

graph theorydesign of algorithmsHamiltonian graphhamiltonicityHamiltonian problemclique decomposition condition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Claw-free graphs---a survey
• Some Theorems on Abstract Graphs
• Toughness in graphs -- a survey
• Sufficient conditions for a graph to be Hamiltonian
• Advances on the Hamiltonian problem -- a survey
• Updating the hamiltonian problem—A survey

Cited In (4)

• A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence
• Some basic properties of multiple Hamiltonian covers
• Normal Eulerian clique-covering and hamiltonicity
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs

This page was built for publication: A clique-covering sufficient condition for hamiltonicity of graphs

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