The following pages link to Path partitions of hypercubes (Q975503):
Displaying 40 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
- Paired many-to-many disjoint path covers in faulty hypercubes (Q391966) (← links)
- Note on the subgraph component polynomial (Q406698) (← links)
- The 2-path-bipanconnectivity of hypercubes (Q497128) (← links)
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
- Generalized Gray codes with prescribed ends (Q512653) (← links)
- Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
- Paired many-to-many disjoint path covers of hypertori (Q730480) (← links)
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
- Many-to-many disjoint paths in faulty hypercubes (Q730958) (← links)
- Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493) (← links)
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes (Q765483) (← links)
- Paired 2-disjoint path covers of multidimensional torus networks with faulty edges (Q894448) (← links)
- Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes (Q897923) (← links)
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← links)
- Path bundles on \(n\)-cubes (Q932673) (← links)
- On generalized middle-level problem (Q985072) (← links)
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← links)
- Partitioning the \(n\)-cube into sets with mutual distance 1 (Q1312006) (← links)
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← links)
- Hamiltonian laceability in hypercubes with faulty edges (Q1693170) (← links)
- Hamiltonian paths in hypercubes with local traps (Q2282293) (← links)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
- Spanning multi-paths in hypercubes (Q2370445) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
- Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
- Paired many-to-many disjoint path covers of the hypercubes (Q2446439) (← links)
- Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph (Q2446463) (← links)
- Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
- The path-distance-width of hypercubes (Q2860874) (← links)
- (Q4029975) (← links)
- Path partitions and forward-only trellis algorithms (Q4679878) (← links)
- General-demand disjoint path covers in a graph with faulty elements (Q4903561) (← links)
- Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges (Q4965905) (← links)
- Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)
- Small matchings extend to Hamiltonian cycles in hypercubes (Q5964997) (← links)
- Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges (Q6671383) (← links)
