Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
From MaRDI portal
Publication:820573
DOI10.1016/j.tcs.2021.07.030OpenAlexW3192403727WikidataQ114129143 ScholiaQ114129143MaRDI QIDQ820573
Publication date: 27 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.030
hypercubefault toleranceinterconnection networkhyper-Hamiltonian laceabilityHamiltonian laceabilitylinear forest
Related Items (2)
Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
- Path bipancyclicity of hypercubes
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- On path bipancyclicity of hypercubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Path embedding in faulty hypercubes
- A note on path bipancyclicity of hypercubes
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Path coverings with prescribed ends in faulty hypercubes
- Hamiltonian paths with prescribed edges in hypercubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Embedded paths and cycles in faulty hypercubes
- Hamiltonicity of hypercubes with faulty vertices
This page was built for publication: Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
