Publication:2857373
From MaRDI portal
zbMath1274.05329MaRDI QIDQ2857373
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001296
05C35: Extremal problems in graph theory
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
On the light side of geometric graphs, A positive fraction mutually avoiding sets theorem, k-Quasi-Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A computational approach to Conway's thrackle conjecture
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Label placement by maximum independent set in rectangles
- Some geometric applications of Dilworth's theorem
- Quasi-planar graphs have a linear number of edges
- On Conway's thrackle conjecture
- Geometric graphs with few disjoint edges
- Which crossing number is it anyway?
- Applications of the crossing number
- Note on geometric graphs
- On grids in topological graphs
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- Coloring k k -free intersection graphs of geometric objects in the plane
- Approximation schemes for covering and packing problems in image processing and VLSI
- Crossing Stars in Topological Graphs
- Combinatorial Geometry and Graph Theory
- Discrete and Computational Geometry
- Crossing patterns of segments
