A clique-covering sufficient condition for hamiltonicity of graphs

DOI10.1016/j.ipl.2009.07.015zbMath1197.05083OpenAlexW2041541789MaRDI QIDQ990948

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

graph theorydesign of algorithmsHamiltonian graphhamiltonicityHamiltonian problemclique decomposition condition

Mathematics Subject Classification ID

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

Related Items (2)

A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence ⋮ Normal Eulerian clique-covering and hamiltonicity

Cites Work

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

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