On the Existence of Hamiltonian Circuits in Faulty Hypercubes
From MaRDI portal
Publication:3985536
DOI10.1137/0404045zbMath0747.05035MaRDI QIDQ3985536
Publication date: 27 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0404045
68P10: Searching and sorting
68M10: Network design and communication in computer systems
68R05: Combinatorics in computer science
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Edge‐fault‐tolerant pancyclicity of alternating group graphs, Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks, Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges, Bipanconnectivity of faulty hypercubes with minimum degree, Fault-tolerant cycle embedding in the faulty hypercubes, Hamiltonian cycles in hypercubes with faulty edges, Conditional edge-fault-tolerant Hamiltonicity of dual-cubes, Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes, Fault tolerance in \(k\)-ary \(n\)-cube networks, Computational complexity of long paths and cycles in faulty hypercubes, Longest fault-free paths in hypercubes with vertex faults, Path bipancyclicity of hypercubes, Fault-free Hamiltonian cycles in twisted cubes with conditional link faults, Conditional fault Hamiltonicity of the complete graph, A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges, Conditional fault hamiltonian connectivity of the complete graph, Fault-free longest paths in star networks with conditional link faults, Embedding Hamiltonian cycles in alternating group graphs under conditional fault model, Long paths in hypercubes with conditional node-faults, Survey on path and cycle embedding in some networks, On the extremal number of edges in Hamiltonian connected graphs, Algorithmic construction of Hamiltonians in pyramids, Hamiltonian laceability in hypercubes with faulty edges, Hamiltonian cycles and paths in faulty twisted hypercubes, Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges, Linear array and ring embeddings in conditional faulty hypercubes, A note on cycle embedding in hypercubes with faulty vertices, Hamiltonian paths in hypercubes with local traps, Hamiltonian paths with prescribed edges in hypercubes, Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model, Edge-bipancyclicity of conditional faulty hypercubes, Regular connected bipancyclic spanning subgraphs of hypercubes, Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes, Fault-free Hamiltonian cycles in crossed cubes with conditional link faults, Unnamed Item, Efficient Connectivity Testing of Hypercubic Networks with Faults, Panconnectivity and edge-pancyclicity ofk-aryn-cubes, Hamiltonian fault-tolerance of hypercubes
