Perfect matchings extend to two or more Hamiltonian cycles in hypercubes

DOI10.1016/j.disc.2018.10.029zbMath1400.05189OpenAlexW2900659842MaRDI QIDQ1625810

Wuyang Sun, Fan Wang

Publication date: 29 November 2018

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

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

zbMATH Keywords

hypercubeHamiltonian cycleperfect matching

Mathematics Subject Classification ID

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

Related Items (2)

Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ A note on equitable Hamiltonian cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extensions to 2-factors in bipartite graphs
• Hamiltonian cycles in hypercubes with faulty edges
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
• Matching graphs of hypercubes and complete bipartite graphs
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• Perfect matchings extend to Hamilton cycles in hypercubes
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Connectivity of Matching Graph of Hypercube
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Small matchings extend to Hamiltonian cycles in hypercubes

This page was built for publication: Perfect matchings extend to two or more Hamiltonian cycles in hypercubes