HAMILTONIAN CYCLES THROUGH MATCHINGS

DOI10.1515/DEMA-1988-0224MaRDI QIDQ3470492zbMATH OpenOpenAlexFDO

Authors Adam Paweł Wojda

Publication date 1988

Published in Demonstratio Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1515/dema-1988-0224

zbMATH Keywords

Hamilton cyclematching

Mathematics Subject Classification ID

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

Recommendations

• Hamiltonian cycles and paths through matchings
• Removable matchings and Hamiltonian cycles
• Graphs with every \(k\)-matching in a Hamiltonian cycle
• Graphs with every matching contained in a cycle
• A degree condition implying that every matching is contained in a Hamiltonian cycle

Cited in

(8)

• Removable matchings and Hamiltonian cycles
• A degree condition implying that every matching is contained in a Hamiltonian cycle
• Graphs with every \(k\)-matching in a Hamiltonian cycle
• Hamiltonian cycles and paths through matchings
• scientific article; zbMATH DE number 5763200 (Why is no real title available?)
• Extensions to 2-factors in bipartite graphs
• Graphs with every matching contained in a cycle
• Bipartite graphs with every matching in a cycle

This page was built for publication: HAMILTONIAN CYCLES THROUGH MATCHINGS

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