On weighted sublinear separators

DOI10.1002/jgt.22777zbMath1522.05246arXiv2007.11853OpenAlexW3215408592MaRDI QIDQ6081561

Zdeněk Dvořák

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.11853

zbMATH Keywords

separatorspolynomial expansion

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

A color-avoiding approach to subgraph counting in bounded expansion classes

Cites Work

• Unnamed Item
• Sublinear separators, fragility and subexponential expansion
• Polynomial expansion and sublinear separators
• On classes of graphs with strongly sublinear separators
• Excluding any graph as a minor allows a low tree-width 2-coloring
• Constant-factor approximation of the domination number in sparse graphs
• Strongly Sublinear Separators and Polynomial Expansion
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• Separators for sphere-packings and nearest neighbor graphs
• Geometric Separators for Finite-Element Meshes
• Coloring and Covering Nowhere Dense Graphs
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
• On the generalised colouring numbers of graphs that exclude a fixed minor

This page was built for publication: On weighted sublinear separators