Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs

DOI10.1016/j.ipl.2009.12.004zbMath1197.05115MaRDI QIDQ991753

Xie-Bin Chen

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.12.004

zbMATH Keywords

hypercube; matching; Hamiltonian path; interconnection network; vertex-disjoint paths; folded hypercube

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Unnamed Item, General-demand disjoint path covers in a graph with faulty elements, The 2-path-bipanconnectivity of hypercubes, Construction of optimal independent spanning trees on folded hypercubes, One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes, Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements, Paired many-to-many disjoint path covers of hypercubes with faulty edges, Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes, Paired 2-disjoint path covers of multidimensional torus networks with faulty edges, Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes, Edge-fault-tolerant diameter and bipanconnectivity of hypercubes, Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle, Paired many-to-many disjoint path covers of the hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Many-to-many disjoint paths in faulty hypercubes
• The two-equal-disjoint path cover problem of matching composition network
• Path partitions of hypercubes
• Survey on path and cycle embedding in some networks
• A survey of the theory of hypercube graphs
• Spanning multi-paths in hypercubes
• Perfect matchings extend to Hamilton cycles in hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Hamiltonian Cycles with Prescribed Edges in Hypercubes