Pages that link to "Item:Q2384812"

The following pages link to Perfect matchings extend to Hamilton cycles in hypercubes (Q2384812):

Displaying 34 items.

• On the path separation number of graphs (Q313786) (← links)
• Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q394540) (← links)
• Extensions to 2-factors in bipartite graphs (Q396808) (← links)
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511) (← links)
• Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network (Q781753) (← links)
• Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations (Q976091) (← links)
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← 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)
• The Kirchhoff index of folded hypercubes and some variant networks (Q1718236) (← links)
• Some properties on Estrada index of folded hypercubes networks (Q1722236) (← links)
• How many circuits determine an oriented matroid? (Q1786051) (← links)
• Perfect matchings and Hamiltonicity in the Cartesian product of cycles (Q1981010) (← links)
• A note on equitable Hamiltonian cycles (Q1983122) (← links)
• Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants (Q2172396) (← links)
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q2175471) (← 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)
• The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← links)
• The Kirchhoff index of hypercubes and related complex networks (Q2312238) (← links)
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
• Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes (Q2444570) (← links)
• On the mutually independent Hamiltonian cycles in faulty hypercubes (Q2446440) (← links)
• On the central levels problem (Q2692785) (← links)
• Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs (Q2699653) (← links)
• Counting Hamiltonian cycles in bipartite graphs (Q2871195) (← links)
• MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers (Q3454125) (← links)
• Matching graphs of Hypercubes and Complete Bipartite Graphs (Q3503492) (← links)
• Hamiltonian fault-tolerance of hypercubes (Q3503505) (← links)