Sciweavers

COMGEO
2008
ACM
14 years 1 days ago
Encompassing colored planar straight line graphs
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba...