Many-to-many two-disjoint path covers in restricted hypercube-like graphs

DOI10.1016/j.tcs.2014.02.014zbMath1359.68233OpenAlexW2136754211MaRDI QIDQ2441778

Sook-Yeon Kim, Jung-Heum Park

Publication date: 28 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.014

zbMATH Keywords

fault toleranceHamiltonian cycleHamiltonian pathinterconnection networkhypercube-like graphdisjoint path coverRHL graph

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) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (10)

Algorithms for finding disjoint path covers in unit interval graphs ⋮ Paired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks ⋮ Disjoint path covers with path length constraints in restricted hypercube-like graphs ⋮ Paired 2-disjoint path covers of multidimensional torus networks with faulty edges ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Paired many-to-many disjoint path covers of hypertori ⋮ Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• On the generalized twisted cube
• 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
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• The two-equal-disjoint path cover problem of matching composition network
• Path partitions of hypercubes
• Counting structures in the Möbius ladder
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Hamiltonian paths with prescribed edges in hypercubes
• Single-source three-disjoint path covers in cubes of connected graphs
• Paired many-to-many disjoint path covers of the hypercubes
• Disjoint path covers in cubes of connected graphs
• Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• On Path Cover Problems in Digraphs and Applications to Program Testing
• General-demand disjoint path covers in a graph with faulty elements
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$

This page was built for publication: Many-to-many two-disjoint path covers in restricted hypercube-like graphs