The following pages link to (Q4881930):
Displaying 19 items.
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q394540) (← links)
- Extensions to 2-factors in bipartite graphs (Q396808) (← links)
- Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations (Q976091) (← links)
- Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes (Q1024489) (← links)
- Matching graphs of hypercubes and complete bipartite graphs (Q1039435) (← links)
- Perfect matchings extend to two or more Hamiltonian cycles in hypercubes (Q1625810) (← links)
- A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes (Q1637214) (← links)
- Extending perfect matchings to Gray codes with prescribed ends (Q1648667) (← links)
- Towards a problem of Ruskey and Savage on matching extendability (Q1689953) (← links)
- Matchings extend to Hamiltonian cycles in 5-cube (Q1692644) (← links)
- A note on equitable Hamiltonian cycles (Q1983122) (← links)
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle (Q2189829) (← links)
- Extending perfect matchings to Hamiltonian cycles in line graphs (Q2223459) (← links)
- Perfect matchings extend to Hamilton cycles in hypercubes (Q2384812) (← links)
- On the mutually independent Hamiltonian cycles in faulty hypercubes (Q2446440) (← links)
- Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs (Q2699653) (← links)
- Matching graphs of Hypercubes and Complete Bipartite Graphs (Q3503492) (← links)
- Hamiltonian fault-tolerance of hypercubes (Q3503505) (← links)
- Small matchings extend to Hamiltonian cycles in hypercubes (Q5964997) (← links)