Paired many-to-many disjoint path covers of hypertori

DOI10.1016/j.dam.2016.09.020zbMath1352.05151OpenAlexW2527919477MaRDI QIDQ730480

Brian G. Kronenthal, Wing Hong Tony Wong

Publication date: 28 December 2016

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

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

zbMATH Keywords

torusdisjoint path coversFlow Freehypertorus

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ Torus-like graphs and their paired many-to-many disjoint path covers

Cites Work

• 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
• Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Hamilton connected graphs
• Hamiltonian-connected graphs
• Path partitions of hypercubes
• A survey of the theory of hypercube graphs
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Lee distance and topological properties of k-ary n-cubes

This page was built for publication: Paired many-to-many disjoint path covers of hypertori