Disjoint paths in hypercubes with prescribed origins and lengths
From MaRDI portal
(Redirected from Publication:5747712)
Recommendations
- scientific article; zbMATH DE number 1161303
- scientific article; zbMATH DE number 219253
- An algorithm on disjoint paths in enhanced hypercubes
- Two spanning disjoint paths with required length in generalized hypercubes
- Disjoint path covers with path length constraints in restricted hypercube-like graphs
- The path-distance-width of hypercubes
- Many-to-many disjoint paths in faulty hypercubes
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Disjoint path covers in cubes of connected graphs
- Disjoint paths in the enhanced hypercube with a faulty subgraph
Cites work
Cited in
(15)- Matchings and paths in the cube
- Fault tolerance of hypercube like networks: spanning laceability under edge faults
- Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
- Disjoint path covers with path length constraints in restricted hypercube-like graphs
- Algorithms for finding disjoint path covers in unit interval graphs
- The path-distance-width of hypercubes
- Distance and Short Parallel Paths in Augmented Cubes
- Path coverings with prescribed ends of the n-dimensional binary hypercube
- Two spanning disjoint paths with required length in generalized hypercubes
- scientific article; zbMATH DE number 219253 (Why is no real title available?)
- One-to-one disjoint path covers on multi-dimensional tori
- Embedding a subclass of trees into hypercubes
- The proofs of two directed paths conjectures of Bollobás and Leader
- Embedding double starlike trees into hypercubes
- Decomposing the cube into paths
This page was built for publication: Disjoint paths in hypercubes with prescribed origins and lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747712)