Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
type: Item
instance of: scholarly article
title: Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
zbMATH Open document ID: 1197.05115
author: Xiebin Chen
published in: Information Processing Letters
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5780801
zbMATH Keywords: hypercube
zbMATH Keywords: vertex-disjoint paths
zbMATH Keywords: Hamiltonian path
zbMATH Keywords: matching
zbMATH Keywords: folded hypercube
zbMATH Keywords: interconnection network
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.12.004
OpenAlex ID: W2070296036
cites work: Q5422499
cites work: Spanning multi-paths in hypercubes
cites work: Many-to-many disjoint paths in faulty hypercubes
cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
cites work: Hamiltonian Cycles with Prescribed Edges in Hypercubes
cites work: Perfect matchings extend to Hamilton cycles in hypercubes
cites work: Path partitions of hypercubes
cites work: A survey of the theory of hypercube graphs
cites work: The two-equal-disjoint path cover problem of matching composition network
cites work: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
cites work: Q4435203
cites work: Survey on path and cycle embedding in some networks
DOI: 10.1016/J.IPL.2009.12.004
description: scientific article; zbMATH DE number 5780801