Perfect matchings extend to Hamilton cycles in hypercubes
From MaRDI portal
Publication:2384812
DOI10.1016/j.jctb.2007.02.007zbMath1126.05080OpenAlexW2088131503WikidataQ56001801 ScholiaQ56001801MaRDI QIDQ2384812
Publication date: 10 October 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.02.007
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (36)
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 ⋮ On the path separation number of graphs ⋮ Extending perfect matchings to Gray codes with prescribed ends ⋮ Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants ⋮ Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Extensions to 2-factors in bipartite graphs ⋮ Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle ⋮ Matching graphs of Hypercubes and Complete Bipartite Graphs ⋮ Hamiltonian fault-tolerance of hypercubes ⋮ Towards a problem of Ruskey and Savage on matching extendability ⋮ Matchings extend to Hamiltonian cycles in 5-cube ⋮ On the central levels problem ⋮ One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs ⋮ Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes ⋮ The Kirchhoff index of folded hypercubes and some variant networks ⋮ On the mutually independent Hamiltonian cycles in faulty hypercubes ⋮ Some properties on Estrada index of folded hypercubes networks ⋮ Extending perfect matchings to Hamiltonian cycles in line graphs ⋮ Perfect matchings and Hamiltonicity in the Cartesian product of cycles ⋮ A note on equitable Hamiltonian cycles ⋮ Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations ⋮ Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs ⋮ How many circuits determine an oriented matroid? ⋮ Small matchings extend to Hamiltonian cycles in hypercubes ⋮ The SAT+CAS method for combinatorial search with applications to best matrices ⋮ 2-Factors Without Close Edges in the n-Dimensional Cube ⋮ Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes ⋮ The Kirchhoff index of hypercubes and related complex networks ⋮ Matching graphs of hypercubes and complete bipartite graphs ⋮ Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network ⋮ Counting Hamiltonian cycles in bipartite graphs
Cites Work
This page was built for publication: Perfect matchings extend to Hamilton cycles in hypercubes