Paired many-to-many disjoint path covers of the hypercubes

DOI10.1016/j.ins.2013.02.028zbMath1284.05274OpenAlexW2010492272MaRDI QIDQ2446439

Xie-Bin Chen

Publication date: 16 April 2014

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.02.028

zbMATH Keywords

hypercubeinterconnection networksHamiltonian pathdisjoint pathsmany-to-many disjoint path cover

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (19)

Algorithms for finding disjoint path covers in unit interval graphs ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Disjoint path covers joining prescribed source and sink sets in interval graphs ⋮ Paired 2-disjoint path covers of multidimensional torus networks with faulty edges ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Ore-type degree conditions for disjoint path covers in simple graphs ⋮ One-to-one disjoint path covers in digraphs ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Generalized Gray codes with prescribed ends ⋮ Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ Hamiltonicity of hypercubes with faulty vertices ⋮ Vertex-disjoint paths joining adjacent vertices in faulty hypercubes ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids

Cites Work

• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• Many-to-many disjoint paths in faulty hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional 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
• Survey on path and cycle embedding in some networks
• A survey of the theory of hypercube graphs
• Spanning multi-paths 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Paired many-to-many disjoint path covers of the hypercubes