Anna Accornero, Massimo Ancona, Sonia Varini. All Separating Triangles in a Plane Graph Can Be Optimally Broken in Polynomial Time. In Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz, editors, Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG 99, Ascona, Switzerland, June 17-19, 1999, Proceedings. Volume 1665 of Lecture Notes in Computer Science, pages 278-290, Springer, 1999. [doi]
Abstract is missing.