Pages that link to "Item:Q2256586"
From MaRDI portal
The following pages link to Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586):
Displaying 26 items.
- Two disjoint 5-holes in point sets (Q827302) (← links)
- Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs (Q2039302) (← links)
- Crossing lemma for the odd-crossing number (Q2088881) (← links)
- Complete graph drawings up to triangle mutations (Q2136833) (← links)
- On crossing-families in planar point sets (Q2144455) (← links)
- Edge-minimum saturated \(k\)-planar drawings (Q2151425) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- A note on universal point sets for planar graphs (Q2206869) (← links)
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
- A superlinear lower bound on the number of 5-holes (Q2306008) (← links)
- Bishellable drawings of $K_n$ (Q4555043) (← links)
- Topological Drawings Meet Classical Theorems from Convex Geometry (Q5014123) (← links)
- On the Maximum Number of Crossings in Star-Simple Drawings of $$K_n$$ with No Empty Lens (Q5014131) (← links)
- On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens (Q5050004) (← links)
- (Q5088968) (← links)
- A Note on Universal Point Sets for Planar Graphs (Q5119378) (← links)
- On plane subgraphs of complete topological drawings (Q5156010) (← links)
- Closing in on Hill's Conjecture (Q5232152) (← links)
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings (Q5370571) (← links)
- A SAT attack on the Erdős-Szekeres conjecture (Q5890914) (← links)
- Induced Ramsey-type results and binary predicates for point sets (Q5915805) (← links)
- A SAT attack on the Erdős-Szekeres conjecture (Q5920081) (← links)
- Bounding the tripartite‐circle crossing number of complete tripartite graphs (Q6057580) (← links)
- Topological drawings meet classical theorems from convex geometry (Q6074002) (← links)
- Twisted ways to find plane structures in simple drawings of complete graphs (Q6145668) (← links)
- (Q6204659) (← links)