A degree condition implying that every matching is contained in a Hamiltonian cycle

DOI10.1016/j.disc.2008.02.003zbMath1214.05111OpenAlexW1969871488MaRDI QIDQ1025570

Denise Amar, Grzegorz Gancarzewicz, Evelyne Flandrin

Publication date: 19 June 2009

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

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

zbMATH Keywords

cyclematchingHamiltonian cycle

Mathematics Subject Classification ID

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

Related Items

Extending perfect matchings to Hamiltonian cycles in line graphs ⋮ Perfect matchings and Hamiltonicity in the Cartesian product of cycles

Cites Work

• Unnamed Item
• Proof of a conjecture of Haeggkvist on cycles and independent edges
• A method in graph theory
• Note on Hamilton Circuits
• HAMILTONIAN CYCLES THROUGH MATCHINGS
• Cycles containing matchings and pairwise compatible euler tours