On classes of graphs with strongly sublinear separators
From MaRDI portal
Publication:1750205
DOI10.1016/j.ejc.2018.02.032zbMath1387.05167arXiv1710.03117MaRDI QIDQ1750205
Publication date: 18 May 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.03117
05C85: Graph algorithms (graph-theoretic aspects)
05C99: Graph theory
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Cites Work
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Graph minors. III. Planar tree-width
- Sublinear separators, fragility and subexponential expansion
- Reduced constants for simple cycle graph separation
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Strongly Sublinear Separators and Polynomial Expansion
- Finding small balanced separators
- A separator theorem for graphs of bounded genus
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- A Separator Theorem for Planar Graphs
- Applications of a Planar Separator Theorem
- First order properties on nowhere dense structures