Hamiltonian cycles and paths in hypercubes with disjoint faulty edges

DOI10.1016/j.ipl.2021.106157zbMath1482.68174arXiv1811.11516OpenAlexW2902453836WikidataQ114167101 ScholiaQ114167101MaRDI QIDQ2234783

Janusz Dybizbański, Andrzej Szepietowski

Publication date: 19 October 2021

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

hypercubefault toleranceHamiltonian cycledisjoint faulty edgesfaulty matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Hamiltonian cycles in hypercubes with faulty edges
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Hamiltonian paths in hypercubes with local traps
• Edge-bipancyclicity of conditional faulty hypercubes
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Hamiltonian cycles in hypercubes with more faulty edges
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

This page was built for publication: Hamiltonian cycles and paths in hypercubes with disjoint faulty edges