Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
type: Item
instance of: scholarly article
title: Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
zbMATH Open document ID: 1335.68188
author: Jung-Heum Park
published in: Theoretical Computer Science
publication date: 2016-01-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6536808
zbMATH Keywords: hypercube-like graph
zbMATH Keywords: disjoint path
zbMATH Keywords: path cover
zbMATH Keywords: path partition
zbMATH Keywords: fault tolerance
zbMATH Keywords: interconnection network
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.12.036
OpenAlex ID: W2227301424
cites work: The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
cites work: Q5422499
cites work: On the generalized twisted cube
cites work: Many-to-many disjoint paths in faulty hypercubes
cites work: Paired many-to-many disjoint path covers of hypercubes with faulty edges
cites work: Paired many-to-many disjoint path covers of the hypercubes
cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
cites work: Path partitions of hypercubes
cites work: Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
cites work: Paired many-to-many disjoint path covers in faulty hypercubes
cites work: Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
cites work: Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
cites work: Many-to-many two-disjoint path covers in restricted hypercube-like graphs
cites work: The two-equal-disjoint path cover problem of matching composition network
cites work: General-demand disjoint path covers in a graph with faulty elements
cites work: One-to-one disjoint path covers on multi-dimensional tori
cites work: Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
cites work: Q4003439
cites work: Counting structures in the Möbius ladder
cites work: On Path Cover Problems in Digraphs and Applications to Program Testing
cites work: Recursive circulants and their embeddings among hypercubes
cites work: Single-source three-disjoint path covers in cubes of connected graphs
cites work: Disjoint path covers in cubes of connected graphs
cites work: Many-to-many two-disjoint path covers in cylindrical and toroidal grids
cites work: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
cites work: One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
cites work: One-to-one disjoint path covers on alternating group graphs
cites work: Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
DOI: 10.1016/J.TCS.2015.12.036
description: scientific article; zbMATH DE number 6536808