Pages that link to "Item:Q2370437"
From MaRDI portal
The following pages link to Hamiltonian paths with prescribed edges in hypercubes (Q2370437):
Displayed 23 items.
- Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges (Q387806) (← links)
- Bipanconnectivity of faulty hypercubes with minimum degree (Q426602) (← links)
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
- Hamiltonian laceability of hypercubes without isometric subgraphs (Q503653) (← links)
- Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes (Q507588) (← 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)
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
- Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes (Q820573) (← links)
- On path bipancyclicity of hypercubes (Q987833) (← links)
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes (Q990111) (← 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)
- 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)
- Matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q2175471) (← links)
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges (Q2258909) (← links)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
- Spanning multi-paths in hypercubes (Q2370445) (← links)
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
- Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
- Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges (Q4965905) (← links)
- Embedded paths and cycles in faulty hypercubes (Q5893937) (← links)