A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence

DOI10.1016/j.disc.2010.11.008zbMath1222.05126OpenAlexW2001616060MaRDI QIDQ626786

Thierry Vallée, Alain Bretto

Publication date: 18 February 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.11.008

zbMATH Keywords

graph theorygraph closureHamiltonian problem

Mathematics Subject Classification ID

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

Cites Work

• Normal Eulerian clique-covering and hamiltonicity
• A clique-covering sufficient condition for hamiltonicity of graphs
• A method in graph theory
• On a closure concept in claw-free graphs
• Advances on the Hamiltonian problem -- a survey
• Closure concepts: A survey
• Sufficient conditions for a graph to be Hamiltonian
• Updating the hamiltonian problem—A survey
• Strengthening the closure concept in claw-free graphs