Many-to-many two-disjoint path covers in cylindrical and toroidal grids

DOI10.1016/j.dam.2014.12.008zbMath1311.05092OpenAlexW2101150428MaRDI QIDQ2341724

Jung-Heum Park, Insung Ihm

Publication date: 28 April 2015

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

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

zbMATH Keywords

disjoint pathpath coverpath partitionsquare gridlattice graphcylindrical grid

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Algorithms for finding disjoint path covers in unit interval graphs, Paired many-to-many disjoint path covers in restricted hypercube-like graphs, Disjoint path covers with path length constraints in restricted hypercube-like graphs, Disjoint path covers joining prescribed source and sink sets in interval graphs, Paired 2-disjoint path covers of multidimensional torus networks with faulty edges, Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes, Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults, Paired 2-disjoint path covers of burnt pancake graphs with faulty elements, Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs, Torus-like graphs and their paired many-to-many disjoint path covers, Unnamed Item, Many-to-many disjoint paths in hypercubes with faulty vertices, Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges, 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

Uses Software

• IDonSquareGridR2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• Many-to-many disjoint paths in faulty hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• On robust identification in the square and King grids
• Edge-bandwidth of grids and tori
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity
• The two-equal-disjoint path cover problem of matching composition network
• Path partitions of hypercubes
• Hamiltonian properties of triangular grid graphs
• Optimal labelling of a product of two paths
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Hamiltonian paths with prescribed edges in hypercubes
• Single-source three-disjoint path covers in cubes of connected graphs
• Paired many-to-many disjoint path covers of the hypercubes
• New lower bound for 2-identifying code in the square grid
• Disjoint path covers in cubes of connected graphs
• Lower bounds on the pathwidth of some grid-like graphs
• Fault-Hamiltonicity of Product Graph of Path and Cycle
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• On Path Cover Problems in Digraphs and Applications to Program Testing
• Hamilton Paths in Grid Graphs
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$