Small matchings extend to Hamiltonian cycles in hypercubes

DOI10.1007/s00373-015-1533-6zbMath1331.05129OpenAlexW2070751683MaRDI QIDQ5964997

Fan Wang, Heping Zhang

Publication date: 2 March 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1533-6

zbMATH Keywords

hypercubematchingHamiltonian cycle

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Perfect matchings extend to two or more Hamiltonian cycles in hypercubes ⋮ Towards a problem of Ruskey and Savage on matching extendability ⋮ Matchings extend to Hamiltonian cycles in 5-cube

Cites Work

• Unnamed Item
• Unnamed Item
• Path partitions of hypercubes
• Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
• Matching graphs of hypercubes and complete bipartite graphs
• Spanning multi-paths in hypercubes
• Perfect matchings extend to Hamilton cycles in hypercubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Connectivity of Matching Graph of Hypercube
• Matching Extendability in Hypercubes
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

This page was built for publication: Small matchings extend to Hamiltonian cycles in hypercubes