Removable matchings and Hamiltonian cycles

DOI10.1016/j.disc.2007.11.053zbMath1179.05087OpenAlexW2014529345MaRDI QIDQ1011771

Hao Li, Zhi-quan Hu

Publication date: 9 April 2009

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

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

zbMATH Keywords

matchingHamiltonian cyclepancyclic

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of a conjecture of Haeggkvist on cycles and independent edges
• A cycle structure theorem for Hamiltonian graphs
• A method in graph theory
• Note on Hamilton Circuits

This page was built for publication: Removable matchings and Hamiltonian cycles