Connected matchingsAichholzer, Oswin (Avtor) Cabello, Sergio (Avtor) Mészáros, Viola (Avtor) Schnider, Patrick (Avtor) Soukup, Jan (Avtor) point setsmatchings for point setsintersection graphWe show that each set of $n\ge 2$ points in the plane in general position has a straight-line matching with at least $(5n+1)/27$ edges whose segments form a connected set, and such a matching can be computed in $O(n \log n)$ time. As an upper bound, we show that for some planar point sets in general position the largest matching whose segments form a connected set has $\lceil \frac{n-1}{3}\rceil$ edges. We also consider a colored version, where each edge of the matching should connect points with different colors.20252025-10-20 11:58:42Neznano23895UDK: 519.17:004ISSN pri članku: 0925-7721DOI: 10.1016/j.comgeo.2025.102174COBISS_ID: 228691203sl