Matching colored points in the plane: Some new results
From MaRDI portal
Publication:5943323
DOI10.1016/S0925-7721(01)00007-4zbMath0990.68170WikidataQ127109478 ScholiaQ127109478MaRDI QIDQ5943323
Publication date: 9 September 2001
Published in: Computational Geometry (Search for Journal in Brave)
Related Items
On plane spanning trees and cycles of multicolored point sets with few intersections, A note on harmonic subgraphs in labelled geometric graphs, PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS, Discrete geometry on colored point sets in the plane -- a survey, On maximum-sum matchings of points, Matching points with disks with a common intersection, Crossing and intersecting families of geometric graphs on point sets, On Hamiltonian alternating cycles and paths, Planar Bichromatic Bottleneck Spanning Trees, Matching colored points with rectangles, Matching random colored points with rectangles, Rainbow polygons for colored point sets in the plane, The balanced connected subgraph problem, Monochromatic geometric k-factors in red-blue sets with white and Steiner points, On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets, Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points
Cites Work
