Pages that link to "Item:Q5317603"
From MaRDI portal
The following pages link to Hamiltonian Cycles with Prescribed Edges in Hypercubes (Q5317603):
Displaying 50 items.
- Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions (Q279915) (← links)
- Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges (Q387806) (← links)
- Paired many-to-many disjoint path covers in faulty hypercubes (Q391966) (← links)
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q394540) (← links)
- Extensions to 2-factors in bipartite graphs (Q396808) (← links)
- Bipanconnectivity of faulty hypercubes with minimum degree (Q426602) (← links)
- Gray codes with bounded weights (Q442379) (← links)
- The 2-path-bipanconnectivity of hypercubes (Q497128) (← links)
- Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes (Q507588) (← links)
- Generalized Gray codes with prescribed ends (Q512653) (← links)
- Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube (Q545386) (← links)
- Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes (Q642966) (← links)
- Computational complexity of long paths and cycles in faulty hypercubes (Q708231) (← links)
- Many-to-many disjoint paths in faulty hypercubes (Q730958) (← links)
- Cycles passing through a prescribed path in a hypercube with faulty edges (Q765497) (← links)
- Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes (Q820573) (← links)
- Path bipancyclicity of hypercubes (Q845903) (← links)
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges (Q963441) (← links)
- Path partitions of hypercubes (Q975503) (← links)
- Some results on topological properties of folded hypercubes (Q976130) (← links)
- On path bipancyclicity of hypercubes (Q987833) (← links)
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes (Q990111) (← links)
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← links)
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges (Q1023065) (← 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)
- Matchings extend to Hamiltonian cycles in 5-cube (Q1692644) (← links)
- Hamiltonian laceability in hypercubes with faulty edges (Q1693170) (← links)
- Hamiltonian paths passing through prescribed edges in balanced hypercubes (Q1727385) (← links)
- Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes (Q1733044) (← links)
- Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links (Q2098177) (← 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)
- Hamiltonian cycles and paths in hypercubes with disjoint faulty edges (Q2234783) (← links)
- Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes (Q2234786) (← links)
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges (Q2258909) (← links)
- Path coverings with prescribed ends in faulty hypercubes (Q2354600) (← links)
- Hamiltonian paths with prescribed edges in hypercubes (Q2370437) (← links)
- Cycles passing through prescribed edges in a hypercube with some faulty edges (Q2380025) (← links)
- Perfect matchings extend to Hamilton cycles in hypercubes (Q2384812) (← links)
- Paired many-to-many disjoint path covers of the hypercubes (Q2446439) (← links)
- Matching graphs of Hypercubes and Complete Bipartite Graphs (Q3503492) (← links)
- Hamiltonian fault-tolerance of hypercubes (Q3503505) (← links)
- Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges (Q4965905) (← links)
- Reconfiguring vertex colourings of 2-trees (Q5217099) (← links)
- Embedded paths and cycles in faulty hypercubes (Q5893937) (← links)
- Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)