Pages that link to "Item:Q4818568"
From MaRDI portal
The following pages link to PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS (Q4818568):
Displaying 9 items.
- Computing the coarseness with strips or boxes (Q526818) (← links)
- Diverse partitions of colored points (Q832914) (← links)
- On plane spanning trees and cycles of multicolored point sets with few intersections (Q835056) (← links)
- On polygons enclosing point sets. II (Q1043822) (← links)
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position. (Q1410590) (← links)
- On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets (Q2573797) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
- Monochromatic partitioning of colored points by lines (Q6161462) (← links)
