Pages that link to "Item:Q391966"
From MaRDI portal
The following pages link to Paired many-to-many disjoint path covers in faulty hypercubes (Q391966):
Displayed 16 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)
- Fault-tolerant cycles embedding in hypercubes with faulty edges (Q507746) (← links)
- Generalized Gray codes with prescribed ends (Q512653) (← links)
- Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← 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)
- 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)
- Ore-type degree conditions for disjoint path covers in simple graphs (Q898138) (← links)
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← links)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← 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)
- Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
- Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)