Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
From MaRDI portal
Publication:1024489
DOI10.1016/j.disc.2008.02.013zbMath1180.05083OpenAlexW1968921005MaRDI QIDQ1024489
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures, 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, MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers, Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle, Matching graphs of Hypercubes and Complete Bipartite Graphs, Towards a problem of Ruskey and Savage on matching extendability, Matchings extend to Hamiltonian cycles in 5-cube, A note on equitable Hamiltonian cycles, Small matchings extend to Hamiltonian cycles in hypercubes
Cites Work
