Guarding disjoint triangles and claws in the plane

Berge, 1958, Sur le couplage maximum d'un graphe, C. R. Acad. Sciences Paris, 247, 258 Bjorling-Sachs, 1995, An efficient algorithm for guard placement in polygons with holes, Discrete Comput. Geom., 13, 77, 10.1007/BF02574029 Blanco, 1996, Illuminating the free space between quadrilaterals with point light sources Chvátal, 1975, A combinatorial theorem in plane geometry, J. Combin. Theory Ser. B, 18, 39, 10.1016/0095-8956(75)90061-1 Czyzowicz, 1993, Illuminating rectangles and triangles on the plane, J. Combin. Theory Ser. B, 57, 1, 10.1006/jctb.1993.1001 Czyzowicz, 1989, Galleries, light matchings and visibility graphs, 382, 316 Czyzowicz, 1995, On illuminating line segments in the plane, Discrete Math., 137, 147, 10.1016/0012-365X(93)E0127-P J. Garcı́a-López, Problemos algorı́tmico-combinatoricos de visibilidad, PhD Thesis, Universidad Polytécnica de Madrid, 1995 Fejes Tóth, 1977, Illumination of convex disks, Acta Math. Acad. Sci. Hungar., 29, 355, 10.1007/BF01895856 Hadwiger, 1960, Ungelöste Probleme – Nr. 38, Elem. Math., 15, 130 Hoffmann, 1990, On the rectilinear Art Gallery Problem, 443, 717 Hoffmann, 1991, The art gallery theorem for polygons with holes, 39 Nishizeki, 1979, Lower bounds on the cardinality of the maximum matchings of planar graphs, Discrete Math., 28, 255, 10.1016/0012-365X(79)90133-X O'Rourke, 1998, Open problems in the combinatorics of visibility and illumination, 237 O'Rourke, 1987 Pulleyblank, 1995, Matchings and extensions, 179 Tóth, 2002, Illumination in the presence of opaque line segments in the plane, Computational Geometry, 21, 193, 10.1016/S0925-7721(01)00057-8 Tóth, 2001, Illuminating both sides of line segments, 2098, 370 Urrutia, 2000, Art gallery and illumination problems, 973