Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle

DOI10.1016/j.ejc.2020.103111zbMath1442.05221OpenAlexW3013932861MaRDI QIDQ2189829

Jiří Fink

Publication date: 16 June 2020

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2020.103111

zbMATH Keywords

Hamiltonian cyclesperfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending pairings to Hamiltonian cycles
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
• Matching graphs of hypercubes and complete bipartite graphs
• Extending perfect matchings to Gray codes with prescribed ends
• Perfect matchings extend to Hamilton cycles in hypercubes
• On hypercube labellings and antipodal monochromatic paths
• Proof of the middle levels conjecture
• Connectivity of Matching Graph of Hypercube
• A Survey of Combinatorial Gray Codes
• A constant-time algorithm for middle levels Gray codes
• Gray codes extending quadratic matchings
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle