A Separator Theorem for String Graphs and Its Applications
From MaRDI portal
Publication:3605480
DOI10.1007/978-3-642-00202-1_1zbMath1211.05066OpenAlexW2170077534MaRDI QIDQ3605480
Publication date: 24 February 2009
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_1
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Connectivity (05C40)
Related Items
Cites Work
- Turán-type results for partial orders and intersection graphs of convex sets
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- Girth in graphs
- A bipartite analogue of Dilworth's theorem
- Separator theorems and Turán-type results for planar intersection graphs
- A Turán-type theorem on chords of a convex polygon
- Intersection graphs of segments
- Coloring relatives of intervals on the plane. I: Chromatic number versus girth
- Crossing number, pair-crossing number, and expansion
- Topological graphs with no large grids
- A separator theorem for graphs of bounded genus
- Graph Theory and Probability
- Coloring k k -free intersection graphs of geometric objects in the plane
- On planar intersection graphs with forbidden subgraphs
- A Separator Theorem for Planar Graphs
- Generalized Nested Dissection
- Applications of a Planar Separator Theorem
- A Separator Theorem for Nonplanar Graphs
- Separators for sphere-packings and nearest neighbor graphs
- Bandwidth, treewidth, separators, expansion, and universality
- Intersection patterns of curves
- String graphs and incomparability graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
