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.68606OpenAlexW1978344479MaRDI QIDQ835056
Mikio Kano, Criel Merino, Jorge Urrutia
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
Related Items (9)
Connecting colored point sets ⋮ 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 ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets ⋮ Monochromatic plane matchings in bicolored point set ⋮ Geometric spanning cycles in bichromatic point sets ⋮ Non-crossing geometric steiner arborescences
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
This page was built for publication: On plane spanning trees and cycles of multicolored point sets with few intersections
