On plane spanning trees and cycles of multicolored point sets with few intersections
From MaRDI portal
Publication:835056
DOI10.1016/j.ipl.2004.12.003zbMath1173.68606MaRDI QIDQ835056
Jorge Urrutia, Criel Merino, Mikio Kano
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.12.003
68R10: Graph theory (including graph drawing) in computer science
Related Items
Connecting colored point sets, On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
Cites Work
- Unnamed Item
- 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
- Ramsey-type results for geometric graphs. I
- On a matching problem in the plane
- PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
- Combinatorial Geometry and Graph Theory
- Matching colored points in the plane: Some new results