Hamiltonian Cycles with Prescribed Edges in Hypercubes
From MaRDI portal
Publication:5317603
DOI10.1137/S0895480103432805zbMath1082.05056OpenAlexW1980811831MaRDI QIDQ5317603
Publication date: 16 September 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480103432805
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 (52)
Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions ⋮ Perfect matchings extend to two or more Hamiltonian cycles in hypercubes ⋮ Hamiltonian paths with prescribed edges in hypercubes ⋮ A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Path bipancyclicity of hypercubes ⋮ Cycles passing through prescribed edges in a hypercube with some faulty edges ⋮ Perfect matchings extend to Hamilton cycles in hypercubes ⋮ 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 ⋮ Paired many-to-many disjoint path covers in faulty hypercubes ⋮ Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Extensions to 2-factors in bipartite graphs ⋮ Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle ⋮ Matching graphs of Hypercubes and Complete Bipartite Graphs ⋮ Hamiltonian fault-tolerance of hypercubes ⋮ Matchings extend to Hamiltonian cycles in 5-cube ⋮ Hamiltonian laceability in hypercubes 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 ⋮ Gray codes with bounded weights ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Paired many-to-many disjoint path covers of the hypercubes ⋮ 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 ⋮ Hamiltonian cycles and paths in hypercubes with disjoint faulty edges ⋮ Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Generalized Gray codes with prescribed ends ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges ⋮ 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 ⋮ Path partitions of hypercubes ⋮ Some results on topological properties of folded hypercubes ⋮ Computational complexity of long paths and cycles in faulty hypercubes ⋮ On path bipancyclicity of hypercubes ⋮ Hamiltonian paths and cycles passing through a prescribed path in hypercubes ⋮ Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs ⋮ Many-to-many disjoint paths in faulty hypercubes ⋮ Hamiltonicity of hypercubes with faulty vertices ⋮ Small matchings extend to Hamiltonian cycles in hypercubes ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges ⋮ Reconfiguring vertex colourings of 2-trees ⋮ Fault-free cycles passing through prescribed paths in hypercubes with faulty edges ⋮ Cycles passing through a prescribed path in a hypercube with faulty edges ⋮ Matching graphs of hypercubes and complete bipartite graphs ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links ⋮ Path coverings with prescribed ends in faulty hypercubes
This page was built for publication: Hamiltonian Cycles with Prescribed Edges in Hypercubes
