Hamiltonian paths with prescribed edges in hypercubes
From MaRDI portal
Publication:2370437
DOI10.1016/j.disc.2005.12.045zbMath1119.05060OpenAlexW2024863625MaRDI QIDQ2370437
Publication date: 26 June 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.045
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)
Related Items (25)
Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Spanning multi-paths in hypercubes ⋮ A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Extending perfect matchings to Gray codes with prescribed ends ⋮ Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges ⋮ Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Many-to-many two-disjoint path covers in restricted hypercube-like graphs ⋮ Disjoint path covers in cubes of connected graphs ⋮ Hamiltonian paths passing through prescribed edges in balanced hypercubes ⋮ Embedded paths and cycles in faulty hypercubes ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ Hamiltonian laceability of hypercubes without isometric subgraphs ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube ⋮ On path bipancyclicity of hypercubes ⋮ Hamiltonian paths and cycles passing through a prescribed path in hypercubes ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids
Cites Work
- Unnamed Item
- On ring embedding in hypercubes with faulty nodes and links
- A survey of the theory of hypercube graphs
- Parallel concepts in graph theory
- Fault-tolerant Hamiltonian laceability of hypercubes.
- On Hamiltonian circuits and spanning trees of hypercubes
- Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- A Survey of Combinatorial Gray Codes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
This page was built for publication: Hamiltonian paths with prescribed edges in hypercubes
