Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$

DOI10.1109/TC.2012.133zbMath1372.68211MaRDI QIDQ5369890

Jung-Heum Park, Sook-Yeon Kim

Publication date: 19 October 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (17)

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 ⋮ Disjoint path covers joining prescribed source and sink sets in interval graphs ⋮ Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Ore-type degree conditions for disjoint path covers in simple graphs ⋮ Paired 2-disjoint path covers of burnt pancake graphs with faulty elements ⋮ 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 ⋮ Disjoint path covers in cubes of connected graphs ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids

This page was built for publication: Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$