A clique-covering sufficient condition for hamiltonicity of graphs

DOI10.1016/J.IPL.2009.07.015MaRDI QIDQ990948zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

clique decomposition conditiondesign of algorithmsgraph theoryHamiltonian graphHamiltonian problemhamiltonicity

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(5)

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

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)