Path partitions of hypercubes
From MaRDI portal
Publication:975503
DOI10.1016/j.ipl.2008.07.015zbMath1191.68037OpenAlexW2013291788MaRDI QIDQ975503
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
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (33)
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 ⋮ Edge-fault-tolerant diameter and bipanconnectivity of hypercubes ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ Note on the subgraph component polynomial ⋮ Paired 2-disjoint path covers of multidimensional torus networks with faulty edges ⋮ Hamiltonian laceability in hypercubes with faulty edges ⋮ Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes ⋮ Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ Paired many-to-many disjoint path covers of the hypercubes ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ Disjoint path covers in cubes of connected graphs ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ General-demand disjoint path covers in a graph with faulty elements ⋮ Generalized Gray codes with prescribed ends ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ On generalized middle-level problem ⋮ Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs ⋮ Hamiltonian paths in hypercubes with local traps ⋮ Paired many-to-many disjoint path covers of hypertori ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Many-to-many disjoint paths in faulty hypercubes ⋮ Hamiltonicity of hypercubes with faulty vertices ⋮ Small matchings extend to Hamiltonian cycles in hypercubes ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ Paired many-to-many disjoint path covers of hypercubes with faulty edges ⋮ Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids
Cites Work
- Spanning multi-paths 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
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Unnamed Item
- Unnamed Item
This page was built for publication: Path partitions of hypercubes
