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

DOI10.1016/J.DISC.2010.11.008MaRDI QIDQ626786zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A new Hamilton circle algorithm of the closure that is complete graph
• A new neighborhood union condition for Hamiltonian graphs
• Publication:3474676
• Structural properties and hamiltonicity of neighborhood graphs
• Hamiltonian-connected graphs and their strong closures
• Closure and stable Hamiltonian properties in claw-free graphs
• scientific article; zbMATH DE number 1786081
• \(\beta\)-neighborhood closures for graphs
• Neighborhood unions and hamiltonicity of graphs
• scientific article; zbMATH DE number 29803

Cites work

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

Cited in

(1)

• Normal Eulerian clique-covering and hamiltonicity

This page was built for publication: A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence

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