Pages that link to "Item:Q3376695"

The following pages link to Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets (Q3376695):

Displaying 25 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)
• 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)
• Dense sets and embedding binary trees into hypercubes (Q869570) (← links)
• On path bipancyclicity of hypercubes (Q987833) (← links)
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes (Q990111) (← 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)
• 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)
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← 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)
• 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)
• Hamiltonian laceability of hypercubes with prescribed linear forest and/or faulty edges (Q6586620) (← links)
• Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges (Q6671383) (← links)