Hamiltonian paths extending a set of matchings in hypercubes

DOI10.1007/S10878-026-01418-3MaRDI QIDQ7296590zbMATH OpenFDO

Authors Abid Ali, Li'Na Ba, Weihua Yang

Publication date 14 July 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01418-3

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
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Graph theory with applications
• Gray codes extending quadratic matchings
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Hamiltonian paths with prescribed edges in hypercubes
• scientific article; zbMATH DE number 5761830 (Why is no real title available?)
• scientific article; zbMATH DE number 888853 (Why is no real title available?)
• Matching graphs of hypercubes and complete bipartite graphs
• Matchings extend to Hamiltonian cycles in 5-cube
• On Hamiltonian circuits and spanning trees of hypercubes
• Path partitions of hypercubes
• Perfect matchings extend to Hamilton cycles in hypercubes
• Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
• Small matchings extend to Hamiltonian cycles in hypercubes
• Spanning multi-paths in hypercubes

This page was built for publication: Hamiltonian paths extending a set of matchings in hypercubes

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