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

DOI10.1109/TC.2012.133MaRDI QIDQ5369890zbMATH OpenFDO

Authors Sook-Yeon Kim, Jung-Heum Park

Publication date 19 October 2017

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

Full work available at URL https://doi.org/10.1109/TC.2012.133

Mathematics Subject Classification ID

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

Cited in

(22)

• One-to-one disjoint path covers in digraphs
• Torus-like graphs and their paired many-to-many disjoint path covers
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Disjoint path covers joining prescribed source and sink sets in interval graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Disjoint path covers in cubes of connected graphs
• 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
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
• Paired 2-disjoint path covers of burnt pancake graphs with faulty elements
• 2-edge-Hamilton-connectedness of complete hypercube-like networks
• Degree conditions for disjoint path covers in graphs
• On the unit interval graphs which are paired k-disjoint path coverable
• 2-edge Hamiltonian connectedness: characterization and results in data center networks
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
• Ore-type degree conditions for disjoint path covers in simple graphs
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

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

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