Path partitions of hypercubes

Cites Work

Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
Title not available (Why is that?)
Hamiltonian Cycles with Prescribed Edges in Hypercubes
Title not available (Why is that?)
Partitions of a graph into paths with prescribed endvertices and lengths
Spanning multi-paths in hypercubes
On Hamiltonian circuits and spanning trees of hypercubes

Cited In (39)

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
Small matchings extend to Hamiltonian cycles in hypercubes
Note on the subgraph component polynomial
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
Disjoint path covers in recursive circulants \(G(2^m,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
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
Title not available (Why is that?)
The 2-path-bipanconnectivity of hypercubes
Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Generalized Gray codes with prescribed ends
Many-to-many disjoint paths in hypercubes with faulty vertices
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
General-demand disjoint path covers in a graph with faulty elements

   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 👍 👎

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)