Pages that link to "Item:Q2509240"

The following pages link to Complete path embeddings in crossed cubes (Q2509240):

Displaying 35 items.

• Two spanning disjoint paths with required length in generalized hypercubes (Q393111) (← links)
• Geodesic pancyclicity and balanced pancyclicity of the generalized base-\(b\) hypercube (Q412364) (← links)
• Geodesic pancyclicity of twisted cubes (Q424780) (← links)
• Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks (Q479026) (← links)
• A note on path embedding in crossed cubes with faulty vertices (Q509890) (← links)
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges (Q545343) (← links)
• Fault-tolerant edge-pancyclicity of locally twisted cubes (Q545346) (← links)
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube (Q545386) (← links)
• Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions (Q555427) (← links)
• Embedding a long fault-free cycle in a crossed cube with more faulty nodes (Q656607) (← links)
• Panconnectivity and edge-pancyclicity of multidimensional torus networks (Q741532) (← links)
• Embedding meshes/tori in faulty crossed cubes (Q765478) (← links)
• Path embeddings in faulty 3-ary \(n\)-cubes (Q845345) (← links)
• A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network (Q881846) (← links)
• Hamiltonian laceability of bubble-sort graphs with edge faults (Q881895) (← links)
• Fault-tolerant embedding of paths in crossed cubes (Q954985) (← links)
• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position (Q963431) (← links)
• Embedding a family of disjoint multi-dimensional meshes into a crossed cube (Q975501) (← links)
• Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position (Q979841) (← links)
• On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
• The bipancycle-connectivity of the hypercube (Q1007866) (← links)
• Embedding a family of disjoint 3D meshes into a crossed cube (Q1031688) (← links)
• Survey on path and cycle embedding in some networks (Q1042541) (← links)
• Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model (Q1750533) (← links)
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture (Q2333183) (← links)
• Embedding meshes into crossed cubes (Q2372214) (← links)
• Constructing the nearly shortest path in crossed cubes (Q2390375) (← links)
• The \(m\)-pancycle-connectivity of a WK-recursive network (Q2465332) (← links)
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults (Q2465338) (← links)
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs (Q2466076) (← links)
• Edge-pancyclicity and path-embeddability of bijective connection graphs (Q2466094) (← links)
• Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
• MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)
• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn (Q6169868) (← links)