String graphs and separators

DOI10.1007/978-88-7642-525-7_5zbMath1323.05040arXiv1311.5048OpenAlexW2963836788MaRDI QIDQ3194867

Ji{ří} Matoušek

Publication date: 20 October 2015

Published in: Geometry, Structure and Randomness in Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

pair-crossing numbercrossing number of a graphintersection graphs of curves in the plane

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (7)

Contraction bidimensionality of geometric intersection graphs ⋮ Graphs of large chromatic number ⋮ Orthogonal Tree Decompositions of Graphs ⋮ Refining the hierarchies of classes of geometric intersection graphs ⋮ Separators in region intersection graphs ⋮ Bounds on the bend number of split and cocomparability graphs ⋮ Contraction-Bidimensionality of Geometric Intersection Graphs

This page was built for publication: String graphs and separators