Pages that link to "Item:Q5747712"
From MaRDI portal
The following pages link to Disjoint paths in hypercubes with prescribed origins and lengths (Q5747712):
Displaying 12 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Two spanning disjoint paths with required length in generalized hypercubes (Q393111) (← links)
- Embedding a subclass of trees into hypercubes (Q534055) (← links)
- Decomposing the cube into paths (Q740656) (← links)
- Matchings and paths in the cube (Q1363756) (← links)
- Fault tolerance of hypercube like networks: spanning laceability under edge faults (Q2192380) (← links)
- Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs (Q2316931) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- The path-distance-width of hypercubes (Q2860874) (← links)
- Distance and Short Parallel Paths in Augmented Cubes (Q3439032) (← links)
- One-to-one disjoint path covers on multi-dimensional tori (Q5248088) (← links)
- Embedding double starlike trees into hypercubes (Q5391457) (← links)