The following pages link to (Q4000490):
Displaying 15 items.
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes (Q266936) (← links)
- Node-to-set disjoint paths problem in star graphs (Q287065) (← links)
- An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380) (← links)
- Cycles embedding in folded hypercubes with conditionally faulty vertices (Q507576) (← links)
- Embedding longest fault-free paths onto star graphs with more vertex faults (Q557839) (← links)
- Edge-bipancyclicity of star graphs with faulty elements (Q650935) (← links)
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults (Q733731) (← links)
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes (Q967363) (← links)
- A further result on fault-free cycles in faulty folded hypercubes (Q990097) (← links)
- Cycle embedding of augmented cubes (Q990439) (← links)
- Fault-tolerant routing in circulant networks and cycle prefix networks (Q1305199) (← links)
- Node-to-node cluster fault tolerant routing in star graphs (Q1350230) (← links)
- Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three (Q1372727) (← links)
- Bus interconnection networks (Q1917343) (← links)
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes (Q2458708) (← links)
