Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes

DOI10.1016/J.DISC.2008.02.013zbMATH Open1180.05083OpenAlexW1968921005MaRDI QIDQ1024489FDOQ1024489

Authors: Petr Gregor 

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.013

Recommendations

• Perfect matchings extend to Hamilton cycles in hypercubes
• Small matchings extend to Hamiltonian cycles in hypercubes
• Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
• Two types of matchings extend to Hamiltonian cycles in hypercubes.
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle

zbMATH Keywords

hypercubeHamiltonian cycleperfect matchingsubcube

Mathematics Subject Classification ID

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

Cites Work

• A Survey of Combinatorial Gray Codes
• Perfect matchings extend to Hamilton cycles in hypercubes
• Title not available (Why is that?)

Cited In (16)

• A note on equitable Hamiltonian cycles
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
• 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
• Connectivity of matching graph of hypercube
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
• Towards a problem of Ruskey and Savage on matching extendability
• Matchings extend to Hamiltonian cycles in 5-cube
• Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
• Perfect matchings extend to Hamilton cycles in hypercubes
• MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
• Matching graphs of Hypercubes and Complete Bipartite Graphs
• The number of perfect matchings in a hypercube
• Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes
• On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes

This page was built for publication: Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes

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