The following pages link to Crossing-Free Subgraphs (Q3967549):
Displayed 30 items.
- Flips in planar graphs (Q950400) (← 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)
- 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 the number of plane geometric graphs (Q2373434) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- On the decay of crossing numbers (Q2464150) (← links)
- Graph minors and the crossing number of graphs (Q3439581) (← links)
- On planar intersection graphs with forbidden subgraphs (Q3605149) (← links)
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method (Q3608305) (← links)
- A Bipartite Strengthening of the Crossing Lemma (Q5452205) (← links)
- Crossing patterns of segments (Q5953378) (← links)
- Sequences of spanning trees and a fixed tree theorem (Q5959551) (← links)