Path partitions of hypercubes

DOI10.1016/J.IPL.2008.07.015MaRDI QIDQ975503zbMATH OpenOpenAlexFDO

Authors Petr Gregor, Tomáš Dvořák

Publication date 9 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.07.015

zbMATH Keywords

hypercubeinterconnection networkspath partitionrouting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Spanning multi-paths in hypercubes
• Paired many-to-many disjoint path covers of the hypercubes
• Spanning paths in hypercubes
• Path coverings with prescribed ends of the \(n\)-dimensional binary hypercube

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1943957 (Why is no real title available?)
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Partitions of a graph into paths with prescribed endvertices and lengths
• Spanning multi-paths in hypercubes

Cited in

(42)

• General-demand disjoint path covers in a graph with faulty elements
• Hamiltonicity of hypercubes with faulty vertices
• Algorithms for finding disjoint path covers in unit 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 many-to-many disjoint path covers of hypercubes with faulty edges
• Paired many-to-many disjoint path covers in faulty hypercubes
• Note on the subgraph component polynomial
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Small matchings extend to Hamiltonian cycles in hypercubes
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• Path coverings with prescribed ends of the \(n\)-dimensional binary hypercube
• Disjoint path covers in recursive circulants G(2ᵐ,4) with faulty elements
• Many-to-many disjoint paths in faulty hypercubes
• Hamiltonian laceability in hypercubes with faulty edges
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• On generalized middle-level problem
• Hamiltonian paths in hypercubes with local traps
• The proofs of two directed paths conjectures of Bollobás and Leader
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Path partitions and forward-only trellis algorithms
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
• Paired many-to-many disjoint path covers of hypertori
• Spanning multi-paths in hypercubes
• Partitioning the n-cube into sets with mutual distance 1
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• The path-distance-width of hypercubes
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Paired many-to-many disjoint path covers of the hypercubes
• Disjoint path covers in cubes of connected graphs
• Single-source three-disjoint path covers in cubes of connected graphs
• scientific article; zbMATH DE number 146667 (Why is no real title available?)
• The 2-path-bipanconnectivity of hypercubes
• Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
• Generalized Gray codes with prescribed ends
• Path bundles on \(n\)-cubes
• Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
• Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
• Many-to-many disjoint paths in hypercubes with faulty vertices
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes

This page was built for publication: Path partitions of hypercubes

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