Extending a perfect matching to a Hamiltonian cycle

MaRDI QIDQ5249239zbMATH OpenFDO

Authors R. E. L. Aldred, A. N. Al-Kenani, Rola A. Hijazi, Carsten Thomassen, Adel Alahmadi, Patrick Solé

Publication date 30 April 2015

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2591/0.html

zbMATH Keywords

matching-extendability propertywell classifying words

Mathematics Subject Classification ID

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

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

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)