Pages that link to "Item:Q854708"

The following pages link to Improving the crossing lemma by finding more crossings in sparse graphs (Q854708):

Displaying 50 items.

• The Szemerédi-Trotter theorem in the complex plane (Q276440) (← links)
• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane (Q375507) (← links)
• Crossing by lines all edges of a line arrangement (Q389464) (← links)
• Crossings in grid drawings (Q405129) (← links)
• Progress on Dirac's conjecture (Q405200) (← links)
• Graphs that admit right angle crossing drawings (Q419368) (← links)
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
• Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
• Szemerédi-Trotter-type theorems in dimension 3 (Q482631) (← links)
• On crossing numbers of geometric proximity graphs (Q632725) (← links)
• Drawing graphs with right angle crossings (Q719252) (← links)
• Light edges in 3-connected 2-planar graphs with prescribed minimum degree (Q723598) (← links)
• A bipartite strengthening of the crossing Lemma (Q968451) (← links)
• On the existence of ordinary triangles (Q1693316) (← links)
• Note on \(k\)-planar crossing numbers (Q1699274) (← links)
• On the \(k\)-planar local crossing number (Q1727762) (← links)
• Gap-planar graphs (Q1786592) (← links)
• Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar (Q1985441) (← links)
• Trapezoids and deltoids in wide planar point sets (Q2000547) (← links)
• Testing gap \(k\)-planarity is NP-complete (Q2032139) (← links)
• Crossing lemma for the odd-crossing number (Q2088881) (← links)
• Edge-minimum saturated \(k\)-planar drawings (Q2151425) (← links)
• Recognizing and embedding simple optimal 2-planar graphs (Q2151433) (← links)
• The crossing number of twisted graphs (Q2163801) (← links)
• On topological graphs with at most four crossings per edge (Q2175439) (← links)
• Efficient generation of different topological representations of graphs beyond-planarity (Q2206855) (← links)
• Improvement on the decay of crossing numbers (Q2376099) (← links)
• Crossings between non-homotopic edges (Q2673492) (← links)
• On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
• Algorithms for Colourful Simplicial Depth and Medians in the Plane (Q2958332) (← links)
• On the Density of Non-simple 3-Planar Graphs (Q2961527) (← links)
• Graphs that Admit Right Angle Crossing Drawings (Q3057620) (← links)
• Drawing Graphs with Right Angle Crossings (Q3183456) (← links)
• On the Decay of Crossing Numbers of Sparse Graphs (Q3466340) (← links)
• On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space (Q3512600) (← links)
• Gap-Planar Graphs (Q4625141) (← links)
• Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
• $$\textit{\textbf{k}}$$-Planar Graphs (Q5001659) (← links)
• Right Angle Crossing Drawings of Graphs (Q5001661) (← links)
• Crossings Between Non-homotopic Edges (Q5014129) (← links)
• Simple Topological Drawings of k-Planar Graphs (Q5014132) (← links)
• 2-Layer k-Planar Graphs (Q5014133) (← links)
• (Q5091019) (← links)
• Two-Planar Graphs Are Quasiplanar (Q5111262) (← links)
• A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
• Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity (Q5141643) (← links)
• A Bipartite Strengthening of the Crossing Lemma (Q5452205) (← links)
• Improvement on the Decay of Crossing Numbers (Q5452206) (← links)
• On RAC drawings of graphs with one bend per edge (Q5915940) (← links)
• On RAC drawings of graphs with one bend per edge (Q5918835) (← links)