Construct · 1 fields · 1 citations

planar separator theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

the result that any planar graph on n vertices can be split into balanced parts by removing only on the order of the square root of n vertices.

In graph theory, planar separator theorem refers to the result that any planar graph on n vertices can be split into balanced parts by removing only on the order of the square root of n vertices. This meaning comes from Lipton (1979) in SIAM Journal on Applied Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how planar separator theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

order4 fields · 6 citationsjingle · one word, four constructs root3 fields · 5 citationsjingle · one word, three constructs split2 fields · 2 citationsjingle · one word, two constructs

References

Lipton, R. J., & Tarjan, R. E. (1979). A Separator Theorem for Planar Graphs. SIAM Journal on Applied Mathematics, 36(2), 177-189. https://doi.org/10.1137/0136016

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct