Hamiltonian cycles and paths through matchings

DOI10.1016/J.ENDM.2005.06.085MaRDI QIDQ3439396zbMATH OpenOpenAlexFDO

Authors Evelyne Flandrin, Grzegorz Gancarzewicz, Denise Amar

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.085

zbMATH Keywords

cycleHamiltonian cyclematching

Mathematics Subject Classification ID

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

Recommendations

• A degree condition implying that every matching is contained in a Hamiltonian cycle
• Bipartite graphs with every matching in a cycle
• HAMILTONIAN CYCLES THROUGH MATCHINGS
• Cycles containing matchings and pairwise compatible euler tours
• Graphs with every matching contained in a cycle

Cites work

• Cycles containing matchings and pairwise compatible euler tours
• HAMILTONIAN CYCLES THROUGH MATCHINGS
• scientific article; zbMATH DE number 3722690 (Why is no real title available?)
• Note on Hamilton Circuits
• Proof of a conjecture of Haeggkvist on cycles and independent edges

Cited in

(7)

• Removable matchings and Hamiltonian cycles
• A degree condition implying that every matching is contained in a Hamiltonian cycle
• Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
• HAMILTONIAN CYCLES THROUGH MATCHINGS
• scientific article; zbMATH DE number 5763200 (Why is no real title available?)
• The matching number and Hamiltonicity of graphs
• Bipartite graphs with every matching in a cycle

This page was built for publication: Hamiltonian cycles and paths through matchings

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