On planar intersection graphs with forbidden subgraphs
From MaRDI portal
Publication:3605149
DOI10.1002/JGT.20332zbMATH Open1161.05042OpenAlexW4252688216MaRDI QIDQ3605149FDOQ3605149
Authors: János Pach, Micha Sharir 
Publication date: 20 February 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/129319
Recommendations
- Separator theorems and Turán-type results for planar intersection graphs
- Turán-type results for partial orders and intersection graphs of convex sets
- Intersection patterns of planar sets
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Coloring k k -free intersection graphs of geometric objects in the plane
Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
Cited In (11)
- The Liouville and the intersection properties are equivalent for planar graphs
- On the Zarankiewicz problem for intersection hypergraphs
- Turán-type results for partial orders and intersection graphs of convex sets
- Turán-type results for intersection graphs of boxes
- Separator theorems and Turán-type results for planar intersection graphs
- Title not available (Why is that?)
- A separator theorem for string graphs and its applications
- The maximum number of tangencies among convex regions with a triangle-free intersection graph
- Interdiction problems on planar graphs
- Title not available (Why is that?)
- A Separator Theorem for String Graphs and Its Applications
This page was built for publication: On planar intersection graphs with forbidden subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605149)
