Conditional fault hamiltonian connectivity of the complete graph
From MaRDI portal
Publication:987830
DOI10.1016/j.ipl.2009.02.008zbMath1209.68054MaRDI QIDQ987830
Jimmy J. M. Tan, Lih-Hsing Hsu, Yuan-Kang Shih, Tung-Yang Ho
Publication date: 16 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.008
68R10: Graph theory (including graph drawing) in computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
On the extremal number of edges in Hamiltonian connected graphs, Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
Cites Work