Hamiltonian Cycles with Prescribed Edges in Hypercubes
From MaRDI portal
Publication:5317603
DOI10.1137/S0895480103432805zbMath1082.05056MaRDI 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
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
68M15: Reliability, testing and fault tolerance of networks and computer systems
05C45: Eulerian and Hamiltonian graphs
Related Items
Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges, Reconfiguring vertex colourings of 2-trees, Embedded paths and cycles in faulty hypercubes, Hamiltonicity of hypercubes with faulty vertices, Small matchings extend to Hamiltonian cycles in hypercubes, Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges, Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions, 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, Bipanconnectivity of faulty hypercubes with minimum degree, Gray codes with bounded weights, 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, Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube, Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes, Computational complexity of long paths and cycles in faulty hypercubes, Many-to-many disjoint paths in faulty hypercubes, Cycles passing through a prescribed path in a hypercube with faulty edges, Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes, Path bipancyclicity of hypercubes, A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges, Path partitions of hypercubes, Some results on topological properties of folded 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, Fault-free cycles passing through prescribed paths in hypercubes with faulty edges, Matching graphs of hypercubes and complete bipartite graphs, Perfect matchings extend to two or more Hamiltonian cycles 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 5-cube, Hamiltonian laceability in hypercubes with faulty edges, Hamiltonian paths passing through prescribed edges in balanced hypercubes, Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes, Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links, Matchings extend to Hamiltonian cycles in hypercubes with faulty edges, Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle, Hamiltonian cycles and paths in hypercubes with disjoint faulty edges, Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes, Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges, 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, Perfect matchings extend to Hamilton cycles in hypercubes, Paired many-to-many disjoint path covers of the hypercubes, Matching graphs of Hypercubes and Complete Bipartite Graphs, Hamiltonian fault-tolerance of hypercubes
