Hamiltonian laceability in hypercubes with faulty edges
From MaRDI portal
Publication:1693170
DOI10.1016/j.dam.2017.10.005zbMath1377.05132OpenAlexW2767270111MaRDI QIDQ1693170
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.10.005
Related Items (3)
Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model
Cites Work
- Hamiltonian cycles in hypercubes with faulty edges
- Computational complexity of long paths and cycles in faulty hypercubes
- Long paths and cycles in hypercubes with faulty vertices
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Path partitions of hypercubes
- Long paths in hypercubes with conditional node-faults
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
- Linear array and ring embeddings in conditional faulty hypercubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- On Hamiltonian circuits and spanning trees of hypercubes
- Hamiltonian fault-tolerance of hypercubes
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Embedded paths and cycles in faulty hypercubes
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hamiltonian laceability in hypercubes with faulty edges
