On grids in topological graphs
From MaRDI portal
Publication:2249043
DOI10.1016/j.comgeo.2014.02.003zbMath1292.05087OpenAlexW2204635654MaRDI QIDQ2249043
János Pach, Eyal Ackerman, Jacob Fox, Andrew Suk
Publication date: 27 June 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.02.003
Related Items
The density of fan-planar graphs ⋮ On fan-crossing and fan-crossing free graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ k-Quasi-Planar Graphs ⋮ Straight-line drawings of 1-planar graphs ⋮ On the Size of Planarly Connected Crossing Graphs ⋮ On fan-crossing graphs ⋮ Unnamed Item ⋮ Tangled Thrackles ⋮ On convex geometric graphs with no \(k+1\) pairwise disjoint edges ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ Unnamed Item ⋮ Quantitative Restrictions on Crossing Patterns
Cites Work
- Unnamed Item
- Disjoint edges in topological graphs
- Excluded permutation matrices and the Stanley-Wilf conjecture
- A bipartite strengthening of the crossing Lemma
- Coloring axis-parallel rectangles
- A Turán-type theorem on chords of a convex polygon
- Label placement by maximum independent set in rectangles
- Some geometric applications of Dilworth's theorem
- Crossing number, pair-crossing number, and expansion
- Applications of the crossing number
- Note on geometric graphs
- Bounds for generalized thrackles
- Topological graphs with no large grids
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- A Separator Theorem for String Graphs and its Applications
- Crossing Stars in Topological Graphs
- Approximation schemes for covering and packing problems in image processing and VLSI
- The Clarkson–Shor Technique Revisited and Extended
- Toward a theory of crossing numbers
- String graphs and incomparability graphs
