Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected

DOI10.1016/j.ipl.2015.09.005zbMath1346.68149MaRDI QIDQ894466

Jun Yuan, Aixia Liu

Publication date: 1 December 2015

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.005

zbMATH Keywords

fault tolerance; triangle-free graph; restricted edge connectivity; super-restricted edge connectivity

Mathematics Subject Classification ID

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

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

05C40: Connectivity