Recommendations
Cites work
- scientific article; zbMATH DE number 3848585 (Why is no real title available?)
- scientific article; zbMATH DE number 4155887 (Why is no real title available?)
- A note on cycle embedding in folded hypercubes with faulty elements
- Constructing edge-disjoint spanning trees in twisted cubes
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
- Embedding a family of disjoint 3D meshes into a crossed cube
- Embedding a family of meshes into twisted cubes
- Embedding graphs onto the Supercube
- Embedding meshes into crossed cubes
- Embedding meshes into locally twisted cubes
- Embedding of cycles in arrangement graphs
- Embedding of meshes in Möbius cubes
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Fault-tolerant cycle-embedding in alternating group graphs
- Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
- Fault-tolerant embedding of paths in crossed cubes
- On embedding subclasses of height-balanced trees in hypercubes
- On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
- Optimal fault-tolerant embedding of paths in twisted cubes
- Path embeddings in faulty 3-ary \(n\)-cubes
- The twisted-cube connected networks
Cited in
(18)- Fault-Tolerant Panconnectivity of Augmented Cubes AQn
- A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
- Enhancing fault tolerance of balanced hypercube networks by the edge partition method
- Doing the twist: diagonal meshes are isomorphic to twisted toroidal meshes
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
- Embedding meshes into locally twisted cubes
- \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
- The number of short cycles in Fibonacci cubes
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Embedding multi-dimensional meshes into twisted cubes
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- Multiple regular graph embeddings into a hypercube with unbounded expansion
- Vertex-independent spanning trees in complete Josephus cubes
- Embedding of tori and grids into twisted cubes
- A fast parallel algorithm for constructing independent spanning trees on parity cubes
- Embedding a family of meshes into twisted cubes
- An algorithm to construct independent spanning trees on parity cubes
This page was built for publication: Embedding meshes into twisted-cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545387)
