Pages that link to "Item:Q765483"
From MaRDI portal
The following pages link to Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes (Q765483):
Displayed 15 items.
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813) (← links)
- The 2-path-bipanconnectivity of hypercubes (Q497128) (← links)
- Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
- Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges (Q526866) (← links)
- Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493) (← 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)
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
- Paired many-to-many disjoint path covers of the hypercubes (Q2446439) (← links)
- The<i>g</i>-extra conditional diagnosability and sequential<i>t/k</i>-diagnosability of hypercubes (Q2804908) (← links)
- General-demand disjoint path covers in a graph with faulty elements (Q4903561) (← links)
- Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements (Q4983546) (← links)
- (Q5036305) (← links)
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← links)