Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
From MaRDI portal
Publication:3376695
DOI10.1002/jgt.20128zbMath1084.05041OpenAlexW4254910198MaRDI QIDQ3376695
Publication date: 24 March 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20128
Related Items (23)
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 ⋮ Cycles passing through prescribed edges in a hypercube with some faulty edges ⋮ Dense sets and embedding binary trees into hypercubes ⋮ 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 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 ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ 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 ⋮ Path coverings with prescribed ends in faulty hypercubes
Cites Work
This page was built for publication: Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
