Hamiltonian paths passing through linear forests in hypercubes with faulty edges
From MaRDI portal
Cites work
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Connectivity of matching graph of hypercube
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Edge-fault-tolerant edge-bipancyclicity of hypercubes
- Graph theory with applications
- Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
- Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
- Hamiltonian cycles in hypercubes with faulty edges
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Hamiltonian laceability in hypercubes with faulty edges
- Hamiltonian paths with prescribed edges in hypercubes
- scientific article; zbMATH DE number 5761830 (Why is no real title available?)
- scientific article; zbMATH DE number 888853 (Why is no real title available?)
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Linear array and ring embeddings in conditional faulty hypercubes
- Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- On Hamiltonian circuits and spanning trees of hypercubes
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Perfect matchings extend to Hamilton cycles in hypercubes
- Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
- Spanning multi-paths in hypercubes
This page was built for publication: Hamiltonian paths passing through linear forests in hypercubes with faulty edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317076)
