A necessary and sufficient condition for a graph to be edge tenacious

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.