On cleaving a planar graph (Q917567)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4156459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On cleaving a planar graph |
scientific article; zbMATH DE number 4156459 |
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
0.8146854043006897
0 references
0.7975480556488037
0 references
0.7906725406646729
0 references
