Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges

From MaRDI portal
Publication:387806


DOI10.1016/j.tcs.2012.10.048zbMath1277.68039MaRDI QIDQ387806

Yuxing Yang, Shi-ying Wang

Publication date: 17 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.048


68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

05C45: Eulerian and Hamiltonian graphs


Related Items



Cites Work