Pages that link to "Item:Q730940"
From MaRDI portal
The following pages link to Long paths and cycles in hypercubes with faulty vertices (Q730940):
Displayed 19 items.
- Rounds in combinatorial search (Q378259) (← links)
- Paired many-to-many disjoint path covers in faulty hypercubes (Q391966) (← links)
- Conditional edge-fault pancyclicity of augmented cubes (Q392181) (← links)
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
- Hamiltonian cycles in hypercubes with faulty edges (Q497955) (← links)
- Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes (Q621644) (← links)
- Computational complexity of long paths and cycles in faulty hypercubes (Q708231) (← links)
- Long paths in hypercubes with a quadratic number of faults (Q730952) (← links)
- Conditional edge-fault Hamiltonicity of augmented cubes (Q985082) (← links)
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes (Q991233) (← links)
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← links)
- Hamiltonian laceability in hypercubes with faulty edges (Q1693170) (← links)
- Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model (Q1750533) (← links)
- Long cycles in hypercubes with optimal number of faulty vertices (Q1928522) (← links)
- Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph (Q2446463) (← links)
- Efficient Connectivity Testing of Hypercubic Networks with Faults (Q3000506) (← links)
- Hamiltonian properties on a class of circulant interconnection networks (Q5012825) (← links)