Pages that link to "Item:Q284574"
From MaRDI portal
The following pages link to Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574):
Displaying 17 items.
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks (Q342731) (← links)
- Paired many-to-many disjoint path covers in faulty hypercubes (Q391966) (← links)
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges (Q526866) (← 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 faulty \(k\)-ary \(n\)-cubes (Q897923) (← links)
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← links)
- The two-equal-disjoint path cover problem of matching composition network (Q963388) (← links)
- The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks (Q2118871) (← links)
- Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
- Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs (Q2316931) (← 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)
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? (Q2632013) (← links)
- Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements (Q4983546) (← links)
- Algorithms and Computation (Q5712162) (← links)
