scientific article; zbMATH DE number 888853
From MaRDI portal
Publication:4881930
Recommendations
- Perfect matchings extend to Hamilton cycles in hypercubes
- Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
- Two types of matchings extend to Hamiltonian cycles in hypercubes.
- Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
- Small matchings extend to Hamiltonian cycles in hypercubes
Cited in
(32)- Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
- Matching graphs of hypercubes and complete bipartite graphs
- 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
- Extending perfect matchings to Gray codes with prescribed ends
- Towards a problem of Ruskey and Savage on matching extendability
- Matchings extend to Hamiltonian cycles in 5-cube
- A note on equitable Hamiltonian cycles
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Perfect matchings extend to Hamilton cycles in hypercubes
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
- On special perfect matchings in a Boolean cube
- scientific article; zbMATH DE number 1811355 (Why is no real title available?)
- Matching graphs of Hypercubes and Complete Bipartite Graphs
- Hamiltonian fault-tolerance of hypercubes
- Connectivity of matching graph of hypercube
- scientific article; zbMATH DE number 5763200 (Why is no real title available?)
- Matching Extendability in Hypercubes
- Enumerating perfect matchings in n-cubes
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- Extensions to 2-factors in bipartite graphs
- scientific article; zbMATH DE number 5233147 (Why is no real title available?)
- Small matchings extend to Hamiltonian cycles in hypercubes
- A kind of matchings extend to Hamiltonian cycles in hypercubes
- Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
- Matchings in hypercubes extend to long cycles
- Saved by the rook: a case of matchings and Hamiltonian cycles
- The Pairing-Hamiltonian property in graph prisms
- Matchings in hypercubes extend to long cycles
- Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4881930)
