On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
From MaRDI portal
Publication:2573797
DOI10.1007/s00373-004-0606-8zbMath1075.05076OpenAlexW2063771021MaRDI QIDQ2573797
Gelasio Salazar, Jorge Urrutia, Criel Merino
Publication date: 24 November 2005
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-004-0606-8
Related Items (5)
Discrete geometry on colored point sets in the plane -- a survey ⋮ A note on two geometric paths with few crossings for points labeled by integers in the plane ⋮ On geometric graphs on point sets in the plane ⋮ Monochromatic plane matchings in bicolored point set ⋮ Geometric spanning cycles in bichromatic point sets
Cites Work
- Unnamed Item
- On plane spanning trees and cycles of multicolored point sets with few intersections
- Simple alternating path problem
- Ramsey-type results for geometric graphs. II
- Bipartite embeddings of trees in the plane
- Intersection number of two connected geometric graphs
- On a matching problem in the plane
- PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
- Matching colored points in the plane: Some new results
This page was built for publication: On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
