1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. K. Diks, H. N. Djidjev, O. Sykora, and I. Vrto. Edge separators for planar graphs and their applications. In Borlin, editor, Proc. of 13th Mathematical Foundation of Computer Science, pages 280–290, Carlsbad. Springer Verlage. LNCS 324.
3. H. N. Djidjev. A separator theorem. Compt. End Acad. Bulg. Sci., 34(5):643–645, 1981.
4. S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979.
5. Hillel Gazit. An improved algorithm for separating a planar graph. manuscript, 1986.