Two types of matchings extend to Hamiltonian cycles in hypercubes.

zbMATH Open1363.05156MaRDI QIDQ3466243FDOQ3466243

Authors: F. Wang, Heping Zhang 

Publication date: 1 February 2016

Recommendations

• Small matchings extend to Hamiltonian cycles in hypercubes
• Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Matchings of quadratic size extend to long cycles in hypercubes
• Matchings extend to Hamiltonian cycles in 5-cube
• Perfect matchings extend to two or more Hamiltonian cycles in hypercubes

zbMATH Keywords

matchinghypercubeHamiltonian cycleperfect matching

Mathematics Subject Classification ID

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

Cited In (13)

• Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Small matchings extend to Hamiltonian cycles in hypercubes
• Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
• A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
• Extending a perfect matching to a Hamiltonian cycle
• Extending pairings to Hamiltonian cycles
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
• Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
• Matchings of quadratic size extend to long cycles in hypercubes
• Towards a problem of Ruskey and Savage on matching extendability
• Matchings extend to Hamiltonian cycles in 5-cube
• A kind of matchings extend to Hamiltonian cycles in hypercubes
• Extending perfect matchings to Gray codes with prescribed ends

This page was built for publication: Two types of matchings extend to Hamiltonian cycles in hypercubes.

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