Embedded paths and cycles in faulty hypercubes

DOI10.1007/s10878-008-9205-6zbMath1242.90189OpenAlexW2007712598MaRDI QIDQ5893937

Ivan S. Gotchev, Nelson Castaneda

Publication date: 12 November 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9205-6

zbMATH Keywords

hypercubefault tolerant embeddingmaximal paths with prescribed ends

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Paths and cycles (05C38)

Related Items (7)

Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Hamiltonian laceability in hypercubes with faulty edges ⋮ Gray codes with bounded weights ⋮ On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube ⋮ Computational complexity of long paths and cycles in faulty hypercubes ⋮ Long paths and cycles in hypercubes with faulty vertices ⋮ Path coverings with prescribed ends in faulty hypercubes

Cites Work

• Unnamed Item
• Fault-tolerant cycle embedding in the hypercube
• Embedding a ring in a hypercube with both faulty links and faulty nodes
• Longest fault-free paths in hypercubes with vertex faults
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Hamiltonian paths with prescribed edges in hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

This page was built for publication: Embedded paths and cycles in faulty hypercubes