The following pages link to Connecting colored point sets (Q868381):
Displaying 9 items.
- On the red/blue spanning tree problem (Q534557) (← links)
- On plane spanning trees and cycles of multicolored point sets with few intersections (Q835056) (← links)
- Intersection number of two connected geometric graphs (Q1350920) (← links)
- A note on two geometric paths with few crossings for points labeled by integers in the plane (Q1699559) (← links)
- Geometric spanning cycles in bichromatic point sets (Q2345513) (← links)
- Spanning trees with low crossing number (Q3358265) (← links)
- Non-intersecting figures in the plane (Q3971781) (← links)
- Non-crossing geometric steiner arborescences (Q5136274) (← links)
- Combinatorial Geometry and Graph Theory (Q5491725) (← links)
