Path coverings with prescribed ends in faulty hypercubes

DOI10.1007/s00373-014-1426-0zbMath1317.05101arXiv1312.1880OpenAlexW1984776836MaRDI QIDQ2354600

Nelson Castaneda, Ivan S. Gotchev

Publication date: 20 July 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1880

zbMATH Keywords

hypercubeHamiltonian cycleHamiltonian pathpath coveringprescribed ends of a path

Mathematics Subject Classification ID

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 (5)

Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes ⋮ Hamiltonian laceability of hypercubes without isometric subgraphs ⋮ Generalized Gray codes with prescribed ends ⋮ Hamiltonicity of hypercubes with faulty vertices ⋮ Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges

Cites Work

• Fault-tolerant cycle embedding in the hypercube
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Spanning multi-paths in hypercubes
• Construction of maximum cycles in faulty binary hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Embedded paths and cycles in faulty hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Path coverings with prescribed ends in faulty hypercubes