Edge-bipancyclicity of hypercubes with faulty edges
From MaRDI portal
Cites work
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Bipanconnectivity of faulty hypercubes with minimum degree
- Bipancyclicism and bipanconnectivity in bipartite graphs
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges
- Cycles embedding in balanced hypercubes with faulty edges and vertices
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- Edge-bipancyclicity of a hypercube with faulty vertices and edges
- Edge-bipancyclicity of conditional faulty hypercubes
- Edge-fault-tolerant bipanconnectivity of hypercubes
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
- Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes
- Fault-tolerant cycles embedding in hypercubes with faulty edges
- Graph theory with applications
- Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
- Hamiltonian laceability in hypercubes with faulty edges
- Hamiltonian properties of twisted hypercube-like networks with more faulty elements
- Linear array and ring embeddings in conditional faulty hypercubes
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Small matchings extend to Hamiltonian cycles in hypercubes
- Two-disjoint-cycle-cover pancyclicity of data center networks
- Two-disjoint-cycle-cover pancyclicity of split-star networks
- Vertex-bipancyclicity in a bipartite graph collection
This page was built for publication: Edge-bipancyclicity of hypercubes with faulty edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903552)