Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

DOI10.1016/J.TCS.2015.12.036MaRDI QIDQ905847zbMATH OpenOpenAlexFDO

Authors Jung-Heum Park

Publication date 28 January 2016

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

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

zbMATH Keywords

disjoint pathfault toleranceinterconnection networkpath coverpath partitionhypercube-like graph

Mathematics Subject Classification ID

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

Recommendations

• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Paired many-to-many disjoint path covers in faulty hypercubes
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest

Cites work

• scientific article; zbMATH DE number 53191 (Why is no real title available?)
• Counting structures in the Möbius ladder
• Disjoint path covers in cubes of connected graphs
• Disjoint path covers in recursive circulants G(2ᵐ,4) with faulty elements
• General-demand disjoint path covers in a graph with faulty elements
• Graph theory
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Many-to-many disjoint path covers in k-ary n-cubes
• Many-to-many disjoint paths in faulty hypercubes
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• On Path Cover Problems in Digraphs and Applications to Program Testing
• On the generalized twisted cube
• One-to-one disjoint path covers on k-ary n-cubes
• One-to-one disjoint path covers on alternating group graphs
• One-to-one disjoint path covers on multi-dimensional tori
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Paired many-to-many disjoint path covers of the hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path partitions of hypercubes
• Recursive circulants and their embeddings among hypercubes
• Single-source three-disjoint path covers in cubes of connected graphs
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• The two-equal-disjoint path cover problem of matching composition network

Cited in

(12)

• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
• Hamiltonian cycles of balanced hypercube with disjoint faulty edges
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Constructing completely independent spanning trees in crossed cubes
• Hamiltonian cycles of balanced hypercube with more faulty edges
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest

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

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