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.