A separator theorem for graphs of bounded genus

1984/09/01 by John R. Gilbert, John R Gilbert, Joan P. Hutchinson +3 · 173 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithms and Data Compression #Biology #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Genus #Mathematical analysis #Mathematics #Zoology

paper · doi:10.1016/0196-6774(84)90019-1

published in Journal of Algorithms 5(3), 391-407 (Elsevier BV)

crossref issued 1984/09/01 · crossref published 1984/09/01 · crossref published-print 1984/09/01 · openalex publication_date 1984/09/01 · crossref created 2005/02/10 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2026/06/10 · openalex updated_date 2026/08/08

Citations

• Applications of a Planar Separator Theorem
• A Separator Theorem for Planar Graphs

Cited by

• Spectral partitioning works: Planar graphs and finite element meshes
• Edge separators for graphs of bounded genus with applications
• Moments of Inertia and Graph Separators
• A Separator Theorem in Minor-Closed Classes
• Geometric Separators for Finite-Element Meshes
• Faster shortest-path algorithms for planar graphs
• Computing the Girth of a Planar Graph in O(n \logn) Time
• Planar separator theorem [wikipedia]