Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults

DOI10.1142/s0129054122500241OpenAlexW4308616793MaRDI QIDQ6132395

Jung-Heum Park

Publication date: 16 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054122500241

zbMATH Keywords

torusdisjoint pathpath coverpath partitiontoroidal grid

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• Paired many-to-many disjoint path covers of hypertori
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• Ore-type degree conditions for disjoint path covers in simple graphs
• A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph
• One-to-one disjoint path covers in digraphs
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
• Torus-like graphs and their paired many-to-many disjoint path covers
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• On Path Cover Problems in Digraphs and Applications to Program Testing
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• 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

This page was built for publication: Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults