Piazza, Roberts and Stueckle recently conjectured that every complete n-partite graph is strictly edge-tenacious. In this paper, we establish a necessary and sufficient condition for a graph to be edge-tenacious. We apply these results to prove the conjecture of Piazza et al. © 2001 Elsevier Science B.V. All rights reserved.
Wang, Z. P., & Zhao, L. C. (2001). A necessary and sufficient condition for a graph to be edge tenacious. Discrete Mathematics, 234(1–3), 191–197. https://doi.org/10.1016/S0012-365X(00)00400-3