Pages that link to "Item:Q2441778"
From MaRDI portal
The following pages link to Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778):
Displaying 20 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)
- 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)
- Odd cycles embedding on folded hypercubes with conditional faulty edges (Q507751) (← links)
- Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges (Q526866) (← 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)
- 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)
- 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)
- Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
- Algorithms and Computation (Q5712162) (← links)
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← links)
- Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest (Q6114850) (← links)
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree (Q6585257) (← links)
