Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
From MaRDI portal
(Redirected from Publication:1024489)
Recommendations
- Perfect matchings extend to Hamilton cycles in hypercubes
- Small matchings extend to Hamiltonian cycles in hypercubes
- Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
- Two types of matchings extend to Hamiltonian cycles in hypercubes.
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
Cites work
Cited in
(16)- On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes
- A note on equitable Hamiltonian cycles
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Small matchings extend to Hamiltonian cycles in hypercubes
- 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
- Connectivity of matching graph of hypercube
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
- Towards a problem of Ruskey and Savage on matching extendability
- Matchings extend to Hamiltonian cycles in 5-cube
- Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
- Perfect matchings extend to Hamilton cycles in hypercubes
- The number of perfect matchings in a hypercube
- MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
- Matching graphs of Hypercubes and Complete Bipartite Graphs
- Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes
This page was built for publication: Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024489)