On cleaving a planar graph (Q917567): Difference between revisions

Let G be a planar n-vertex graph with non-negative vertex weights which sum to no more than 1. It is proved that G can be recursively separated into components of weight \(\leq \epsilon\) by removing \(4\sqrt{n/\epsilon}\) vertices. Applications to planar graphs with given radius are considered.