The following pages link to Embedding meshes into twisted-cubes (Q545387):
Displaying 10 items.
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← links)
- Multiple regular graph embeddings into a hypercube with unbounded expansion (Q902523) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- The number of short cycles in Fibonacci cubes (Q2031057) (← links)
- \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) (Q2144839) (← links)
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model (Q2446379) (← links)
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? (Q2632013) (← links)
- Fault-Tolerant Panconnectivity of Augmented Cubes AQn (Q5207034) (← links)
- Enhancing fault tolerance of balanced hypercube networks by the edge partition method (Q6138833) (← links)
