Extending a perfect matching to a Hamiltonian cycle
From MaRDI portal
Publication:5249239
zbMATH Open1311.05157MaRDI QIDQ5249239FDOQ5249239
Patrick Solé, R. E. L. Aldred, Carsten Thomassen, Adel Alahmadi, Rola A. Hijazi, A. N. Al-Kenani
Publication date: 30 April 2015
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2591/0.html
Recommendations
- Small matchings extend to Hamiltonian cycles in hypercubes
- Two types of matchings extend to Hamiltonian cycles in hypercubes.
- Perfect matchings extend to Hamilton cycles in hypercubes
- Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
- Matchings extend to Hamiltonian cycles in 5-cube
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (10)
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
- Perfect matchings and Hamiltonicity in the Cartesian product of cycles
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
- Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
- Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
- Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
- Towards a problem of Ruskey and Savage on matching extendability
- Extending perfect matchings to Gray codes with prescribed ends
- Perfect matchings extend to Hamilton cycles in hypercubes
This page was built for publication: Extending a perfect matching to a Hamiltonian cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249239)
