On planar intersection graphs with forbidden subgraphs

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

zbMATH Keywords

intersection graphsgeometric graphstopological graphsforbidden subgraphscrossing Lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)

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

Cites work

• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Crossing Stars in Topological Graphs
• Crossing-Free Subgraphs
• On Crum's Problem
• On the maximum number of edges in topological graphs with no four pairwise crossing edges

Cited in

(12)

• Separator theorems and Turán-type results for planar intersection graphs
• scientific article; zbMATH DE number 6850320 (Why is no real title available?)
• A separator theorem for string graphs and its applications
• scientific article; zbMATH DE number 4170928 (Why is no real title available?)
• On the Zarankiewicz problem for intersection hypergraphs
• Intersection patterns of planar sets
• A Separator Theorem for String Graphs and Its Applications
• Turán-type results for partial orders and intersection graphs of convex sets
• Turán-type results for intersection graphs of boxes
• The maximum number of tangencies among convex regions with a triangle-free intersection graph
• The Liouville and the intersection properties are equivalent for planar graphs
• Interdiction problems on planar graphs

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)