All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time. - Anna Accornero; Massimo Ancona; Sonia Varini (Int. J. Found. Comput. Sci., 2000)