The following pages link to (Q4028120):
Displaying 7 items.
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Separation of continua by circles (Q753996) (← links)
- Obstacle numbers of graphs (Q977184) (← links)
- Computing circular separability (Q1079817) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- On the shortest separating cycle (Q2306364) (← links)
- Circular separability of polygons (Q5943827) (← links)