On grids in topological graphs
From MaRDI portal
Publication:2249043
DOI10.1016/J.COMGEO.2014.02.003zbMATH Open1292.05087OpenAlexW2204635654MaRDI QIDQ2249043FDOQ2249043
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
Cites Work
- Title not available (Why is that?)
- The Clarkson–Shor Technique Revisited and Extended
- A Separator Theorem for String Graphs and its Applications
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Approximation schemes for covering and packing problems in image processing and VLSI
- 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
- String graphs and incomparability graphs
- Coloring axis-parallel rectangles
- Disjoint edges in topological graphs
- Toward a theory of crossing numbers
- Bounds for generalized thrackles
- Crossing Stars in Topological Graphs
- Note on geometric graphs
- Topological graphs with no large grids
- A bipartite strengthening of the crossing Lemma
Cited In (16)
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- The density of fan-planar graphs
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Constructing \(\gamma\)-sets of grids
- A survey of grid diagrams and a proof of Alexander's theorem
- On fan-crossing graphs
- Straight-line drawings of 1-planar graphs
- Quantitative Restrictions on Crossing Patterns
- On fan-crossing and fan-crossing free graphs
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- Title not available (Why is that?)
- On the Size of Planarly Connected Crossing Graphs
- On disjoint crossing families in geometric graphs
- Tangled Thrackles
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges
- k-Quasi-Planar Graphs
This page was built for publication: On grids in topological graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249043)