Answers are grounded in this paper and cite their sources.
Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√n) vertices. This separator theorem, in combination with a divide-and-conquer strategy, leads to many new complexity results for planar graph problems. This paper describes some of these results.
No takes yet. Share an insight, caveat, or question.
Lipton et al. (1977) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: