On cleaving a planar graph (Q917567): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q175610 |
||
| Property / reviewed by | |||
| Property / reviewed by: Jozef Širáň / rank | |||
Revision as of 05:08, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On cleaving a planar graph |
scientific article |
Statements
On cleaving a planar graph (English)
0 references
1990
0 references
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.
0 references
separation
0 references
vertex weights
0 references
planar graphs
0 references
