Pages that link to "Item:Q1387850"
From MaRDI portal
The following pages link to On geometric graphs with no two edges in convex position (Q1387850):
Displaying 20 items.
- Drawing graphs with vertices and edges in convex position (Q340526) (← links)
- A note on light geometric graphs (Q389475) (← links)
- On the light side of geometric graphs (Q409464) (← links)
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges (Q503641) (← links)
- Ball polytopes and the Vázsonyi problem (Q624221) (← links)
- The maximum number of edges in geometric graphs with pairwise virtually avoiding edges (Q742617) (← links)
- A new proof of Vázsonyi's conjecture (Q942175) (← links)
- Geometric graphs with no two parallel edges (Q949787) (← links)
- A Turán-type theorem on chords of a convex polygon (Q1204472) (← links)
- A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem (Q1380926) (← links)
- On geometric graphs with no \(k\) pairwise parallel edges (Q1389246) (← links)
- Geometric graphs with no self-intersecting path of length three (Q1883291) (← links)
- Extremal theory for convex matchings in convex geometric graphs (Q1911768) (← links)
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind (Q1972357) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Linear algebra approach to geometric graphs (Q2459492) (← links)
- On the number of edges in geometric graphs without empty triangles (Q2637713) (← links)
- Edge Conflicts do not Determine Geodesics in the Associahedron (Q4638997) (← links)
- Discrete and Computational Geometry (Q5897105) (← links)
- A note on lenses in arrangements of pairwise intersecting circles in the plane (Q6574385) (← links)
