Pages that link to "Item:Q730958"
From MaRDI portal
The following pages link to Many-to-many disjoint paths in faulty hypercubes (Q730958):
Displayed 42 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)
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813) (← 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)
- Odd cycles embedding on folded hypercubes with conditional faulty edges (Q507751) (← links)
- Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes (Q621644) (← links)
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
- Maximally local connectivity and connected components of augmented cubes (Q726407) (← links)
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
- Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493) (← links)
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341) (← links)
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes (Q765483) (← links)
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links (Q845346) (← 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)
- The triangular pyramid: Routing and topological properties (Q985070) (← links)
- Conditional edge-fault Hamiltonicity of augmented cubes (Q985082) (← links)
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes (Q991233) (← links)
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← links)
- The spanning connectivity of folded hypercubes (Q991888) (← links)
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← links)
- A note on cycle embedding in hypercubes with faulty vertices (Q1944949) (← links)
- The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks (Q2118871) (← links)
- Hamiltonian paths in hypercubes with local traps (Q2282293) (← links)
- Vertex-disjoint paths joining adjacent vertices in faulty hypercubes (Q2330114) (← 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)
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes (Q2443019) (← 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)
- General-demand disjoint path covers in a graph with faulty elements (Q4903561) (← links)
- (Q5036305) (← links)
- Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)