Pages that link to "Item:Q3648508"
From MaRDI portal
The following pages link to Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices (Q3648508):
Displaying 41 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)
- Gray codes with bounded weights (Q442379) (← 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)
- Hamiltonian laceability of hypercubes without isometric subgraphs (Q503653) (← links)
- Generalized Gray codes with prescribed ends (Q512653) (← links)
- Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
- Computational complexity of long paths and cycles in faulty hypercubes (Q708231) (← 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)
- Long paths in hypercubes with a quadratic number of faults (Q730952) (← links)
- Many-to-many disjoint paths in faulty hypercubes (Q730958) (← links)
- Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493) (← links)
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes (Q765483) (← 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)
- Path partitions of hypercubes (Q975503) (← links)
- A class of hierarchical graphs as topologies for interconnection networks (Q982664) (← links)
- On generalized middle-level problem (Q985072) (← links)
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← links)
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← links)
- One-to-one disjoint path covers in digraphs (Q1694726) (← links)
- Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← 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)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← 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)
- Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
- Efficient Connectivity Testing of Hypercubic Networks with Faults (Q3000506) (← links)
- Hamiltonian fault-tolerance of hypercubes (Q3503505) (← links)
- General-demand disjoint path covers in a graph with faulty elements (Q4903561) (← links)
- Hamiltonicity of hypercubes with faulty vertices (Q5964820) (← links)
- Paired 2-disjoint path covers of burnt pancake graphs with faulty elements (Q6138830) (← links)