Torus-like graphs and their paired many-to-many disjoint path covers

DOI10.1016/j.dam.2020.09.008zbMath1471.05089OpenAlexW3091802786MaRDI QIDQ2217462

Jung-Heum Park

Publication date: 29 December 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.09.008

zbMATH Keywords

torusdisjoint pathpath coverpath partitioncylindrical grid

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Connectivity and constructive algorithms of disjoint paths in dragonfly networks ⋮ Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ The spanning cyclability of Cayley graphs generated by transposition trees ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for finding disjoint path covers in unit interval graphs
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• Generalized Gray codes with prescribed ends
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers of hypertori
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• An efficient algorithm to construct disjoint path covers of DCell networks
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
• Ore-type degree conditions for disjoint path covers in simple graphs
• Linear algorithm for optimal path cover problem on interval graphs
• One-to-one disjoint path covers in digraphs
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• On Path Cover Problems in Digraphs and Applications to Program Testing
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• One-to-one disjoint path covers on multi-dimensional tori
• Longest fault-free paths in star graphs with vertex faults

This page was built for publication: Torus-like graphs and their paired many-to-many disjoint path covers