Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
From MaRDI portal
Publication:905847
DOI10.1016/j.tcs.2015.12.036zbMath1335.68188OpenAlexW2227301424MaRDI QIDQ905847
Publication date: 28 January 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.036
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest ⋮ Hamiltonian cycles of balanced hypercube with more faulty edges ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
Cites Work
- Unnamed Item
- Unnamed Item
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- One-to-one disjoint path covers on alternating group graphs
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
- On the generalized twisted cube
- Many-to-many disjoint paths in faulty hypercubes
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
- The two-equal-disjoint path cover problem of matching composition network
- Path partitions of hypercubes
- Recursive circulants and their embeddings among hypercubes
- Counting structures in the Möbius ladder
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs
- Single-source three-disjoint path covers in cubes of connected graphs
- Paired many-to-many disjoint path covers of the hypercubes
- Disjoint path covers in cubes of connected graphs
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- On Path Cover Problems in Digraphs and Applications to Program Testing
- General-demand disjoint path covers in a graph with faulty elements
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- One-to-one disjoint path covers on multi-dimensional tori
- Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
This page was built for publication: Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs