Extending a perfect matching to a Hamiltonian cycle
From MaRDI portal
(Redirected from Publication:5249239)
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
(14)- Extending perfect matchings to Hamiltonian cycles in line graphs
- The Pairing-Hamiltonian property in graph prisms
- Matchings in hypercubes extend to long cycles
- 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
- Matchings in hypercubes extend to long cycles
- 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
- Saved by the rook: a case of matchings and Hamiltonian cycles
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)
