Edge separators for graphs of bounded genus with applications

1993/05/01 by Ondrej Sýkora, Ondřej Sýkora, Imrich Vrt’o +1 · 20 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Book embedding #Bounded function #Chordal graph #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph #Isoperimetric inequality #Limits and Structures in Graph Theory #Line graph #Mathematics #Outerplanar graph #Pathwidth #Physics #Planar graph #Separator (oil production) #Upper and lower bounds #Vertex (graph theory)

paper · pdf · doi:10.1016/0304-3975(93)90031-n

published in Theoretical Computer Science 112(2), 419-429 (Elsevier BV)

crossref issued 1993/05/01 · crossref published 1993/05/01 · crossref published-print 1993/05/01 · openalex publication_date 1993/05/01 · crossref created 2002/07/25 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2026/03/16 · openalex updated_date 2026/07/31

Citations

• Planar separators and the Euclidean norm
• Applications of a Planar Separator Theorem
• Area-efficient graph layouts
• A Separator Theorem for Planar Graphs
• Edge Separators of Planar and Outerplanar Graphs With Applications
• Finding small simple cycle separators for 2-connected planar graphs
• A separator theorem for graphs of bounded genus
• A separator theorem for graphs with an excluded minor and its applications

Cited by

• Planar separator theorem [wikipedia]