Pages that link to "Item:Q1023065"

The following pages link to Fault-free cycles passing through prescribed paths in hypercubes with faulty edges (Q1023065):

Displaying 18 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)
• The 2-path-bipanconnectivity of hypercubes (Q497128) (← 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)
• Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493) (← links)
• Cycles passing through a prescribed path in a hypercube with faulty edges (Q765497) (← links)
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← 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)
• An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← 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)
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph (Q2446463) (← 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)
• Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)