N-separators in planar graphs

We analyse N-separators in planar weighted graphs for any integer N. The well-known result due to Lipton and Tarjan [5] is obtained in the case N=2. The existence of an N-separator is examined and the exact bounds for the best separation are demonstrated.

[1]  Norishige Chiba,et al.  Applications of the Lipton and Tarjan's Planar Separator Theorem , 1981 .

[2]  F. Comellas,et al.  New large graphs with given degree and diameter , 1994, math/9411218.

[3]  Martin Charles Golumbic,et al.  Graph Theory, Combinatorics and Algorithms , 2005 .

[4]  Arnold L. Rosenberg,et al.  Graph Separators, with Applications , 2001, Frontiers of Computer Science.

[5]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[6]  Nicholas C. Wormald,et al.  Geometric separator theorems and applications , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[7]  Alexander Schrijver,et al.  Paths, Flows, and VLSI-Layout , 1990 .

[8]  Michael R. Fellows,et al.  Large Planar Graphs with Given Diameter and Maximum Degree , 1995, Discret. Appl. Math..