Planar Separators

From MaRDI portal
Publication:4296512

DOI10.1137/S0895480191198768zbMath0797.05039OpenAlexW2913492813MaRDI QIDQ4296512

Noga Alon, Robin Thomas, P. D. Seymour

Publication date: 10 October 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480191198768




Related Items

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern CoveringSurface triangulations with isometric boundaryUnnamed ItemThe game of overprescribed Cops and Robbers played on graphsApproximation algorithms for cutting a convex polyhedron out of a sphereOn the separation profile of infinite graphsA crossing lemma for multigraphsOn graph thickness, geometric thickness, and separator theoremsCounting cycles on planar graphs in subexponential timeCounting cycles on planar graphs in subexponential timeTreetopes and their graphsVertex Fault-Tolerant Geometric Spanners for Weighted PointsTheory and application of width bounded geometric separatorsSpanners for geodesic graphs and visibility graphsVulnerability of nearest neighbor graphsAnticoloring of a family of grid graphsAnticoloring and separation of graphsPlanar graph bipartization in linear timeCubic polyhedral Ramanujan graphs with face size no larger than sixA PTAS for a disc covering problem using width-bounded separatorsMULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDINGVertex fault-tolerant spanners for weighted points in polygonal domainsBidimensionality and KernelsEdge integrity of nearest neighbor graphs and separator theoremsNested cycles in large triangulations and crossing-critical graphsGenerating irregular partitionable data structuresThe first order definability of graphs with separators via the Ehrenfeucht gameUnnamed ItemA crossing lemma for multigraphs