The following pages link to Crossing-Free Subgraphs (Q3967549):
Displaying 50 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Counting carambolas (Q293619) (← links)
- On the number of anchored rectangle packings for a planar point set (Q344784) (← links)
- Crossings in grid drawings (Q405129) (← links)
- Progress on Dirac's conjecture (Q405200) (← links)
- Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
- Graphs that admit right angle crossing drawings (Q419368) (← links)
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- An incidence theorem in higher dimensions (Q452010) (← links)
- On degrees in random triangulations of point sets (Q549246) (← links)
- On crossing numbers of geometric proximity graphs (Q632725) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- A Szemerédi-Trotter type theorem in \(\mathbb R^4\) (Q745661) (← links)
- On the intersections of non-homotopic loops (Q831716) (← links)
- Flips in planar graphs (Q950400) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- On edges crossing few other edges in simple topological complete graphs (Q1011770) (← links)
- Degenerate crossing numbers (Q1014334) (← links)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- On polygons enclosing point sets. II (Q1043822) (← links)
- A lower bound for the optimal crossing-free Hamiltonian cycle problem (Q1091399) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Penny-packing and two-dimensional codes (Q1262539) (← links)
- Graphs drawn with few crossings per edge (Q1272189) (← links)
- On counting triangulations in \(d\) dimensions (Q1314531) (← links)
- Counting triangle crossings and halving planes (Q1338957) (← links)
- Onion polygonizations (Q1351597) (← links)
- On the number of simplicial complexes in \(\mathbb{R}^ d\) (Q1370935) (← links)
- Crossing-number critical graphs have bounded path-width (Q1400969) (← links)
- On distinct sums and distinct distances. (Q1418004) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- 2-point site Voronoi diagrams (Q1613413) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces (Q1660623) (← links)
- On the number of touching pairs in a set of planar curves (Q1693324) (← links)
- The number of crossings in multigraphs with no empty lens (Q1725755) (← links)
- Crossing numbers and stress of random graphs (Q1725756) (← links)
- On degree properties of crossing-critical families of graphs (Q1733938) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- A better upper bound on the number of triangulations of a planar point set (Q1873821) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- On the degenerate crossing number (Q1953051) (← links)
- Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
- Testing gap \(k\)-planarity is NP-complete (Q2032139) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Crossing lemma for the odd-crossing number (Q2088881) (← links)
