General-demand disjoint path covers in a graph with faulty elements
From MaRDI portal
Publication:4903561
DOI10.1080/00207160.2012.656614zbMath1257.05073OpenAlexW2158771982MaRDI QIDQ4903561
Publication date: 22 January 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.656614
Communication networks in operations research (90B18) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (8)
Algorithms for finding disjoint path covers in unit interval graphs ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Characterization of interval graphs that are unpaired 2-disjoint path coverable ⋮ Disjoint path covers joining prescribed source and sink sets in interval graphs ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ The bicube: an interconnection of two hypercubes ⋮ One-to-one disjoint path covers on multi-dimensional tori
Cites Work
- Many-to-many disjoint paths in faulty hypercubes
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
- The super laceability of the hypercubes
- The two-equal-disjoint path cover problem of matching composition network
- Path partitions of hypercubes
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
- Proper interval graphs and the guard problem
- The super-connected property of recursive circulant graphs
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
This page was built for publication: General-demand disjoint path covers in a graph with faulty elements
