Skip to main content
SpringerLink
Log in

Über separatoren in planaren graphen

Separators in planar graphs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A family of planar graphs Hn is exhibited such that for all n

  1. 1)

    Hn is planar and has n nodes

  2. 2)

    every separator in the sense of Lipton, Rose and Tarjan [1] has at least \(\sqrt {\tfrac{7}{6}} \sqrt n\) nodes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literatur

  1. Lipton, R.J., Tarjan, R.E.: A Separator Theorem for Planar Graphs. Siam J. Appl. Math., 36, 177–189 (1979)

    Google Scholar 

  2. Lipton, R.J., Tarjan, R.E.: Applications of a Planar Separator Theorem. 18th IEEE-FOCS, 162–170, 1977

Download references

Author information

Authors and Affiliations

  1. Fakultät Tür Mathematik, Universität Bielefeld, 4800, Bielefeld 1, Germany (Fed. Rep.)

    Reiner Philipp & Ernst -Jürgen Prauß

Authors
  1. Reiner Philipp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ernst -Jürgen Prauß
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Philipp, R., Prauß, E.J. Über separatoren in planaren graphen. Acta Informatica 14, 87–106 (1980). https://doi.org/10.1007/BF00289065

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289065

Search

Navigation