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

DOI10.1016/J.IPL.2009.12.004zbMATH Open1197.05115OpenAlexW2070296036MaRDI QIDQ991753FDOQ991753

Authors: Xiebin 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

Recommendations

• Paired many-to-many disjoint path covers of the hypercubes
• Disjoint path covers in cubes of connected graphs
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

zbMATH Keywords

matchinghypercubeHamiltonian pathinterconnection networkvertex-disjoint pathsfolded hypercube

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

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

Cited In (16)

• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Paired many-to-many disjoint path covers of the hypercubes
• Ore-type degree conditions for disjoint path covers in simple graphs
• The 2-path-bipanconnectivity of hypercubes
• Construction of optimal independent spanning trees on folded hypercubes
• One-to-one conditional path covers on augmented cubes
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
• General-demand disjoint path covers in a graph with faulty elements

This page was built for publication: Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991753)