A Separator Theorem for Planar Graphs f (1977)
by
Richard J. Lipton
,
Robert E. Tarjan
| Citations: | 338 - 1 self |
BibTeX
@MISC{Lipton77aseparator,
author = {Richard J. Lipton and Robert E. Tarjan},
title = {A Separator Theorem for Planar Graphs f},
year = {1977}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which finds such a partition A, B, C in O(n) time.
