The following pages link to Cycle embedding of augmented cubes (Q990439):
Displaying 20 items.
- Two node-disjoint paths in balanced hypercubes (Q279509) (← links)
- Strong matching preclusion for augmented cubes (Q387805) (← links)
- Conditional edge-fault pancyclicity of augmented cubes (Q392181) (← links)
- Embedding long cycles in faulty \(k\)-ary \(2\)-cubes (Q426579) (← links)
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- Fault-tolerant edge-pancyclicity of locally twisted cubes (Q545346) (← links)
- Super connectivity of \(k\)-regular interconnection networks (Q546006) (← links)
- Edge-fault-tolerant vertex-pancyclicity of augmented cubes (Q656602) (← links)
- Vertex-pancyclicity of augmented cubes with maximal faulty edges (Q726559) (← links)
- Conditional edge-fault Hamiltonicity of augmented cubes (Q985082) (← links)
- Edge-fault-tolerant node-pancyclicity of twisted cubes (Q990961) (← links)
- Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes (Q1002284) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- Vertex-bipancyclicity of the generalized honeycomb tori (Q2389470) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? (Q2632013) (← links)
- Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle (Q2673946) (← links)
- An upper bound for the crossing number of augmented cubes (Q2868165) (← links)
- On regular subgraphs of augmented cubes (Q5012374) (← links)
- Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes (Q6038696) (← links)
