scientific article; zbMATH DE number 140478
From MaRDI portal
Publication:4028896
convex partition of the planedual graphedge covergalleriesilluminationlight matchingsline segmentsmaximum matchingpolynomial time algorithmvisibility graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cited in
(10)- Illuminating labyrinths.
- Illuminating disjoint line segments in the plane
- Obituary: Ivan Rival
- Guarding disjoint triangles and claws in the plane
- Illuminating a network from its nodes
- scientific article; zbMATH DE number 4202280 (Why is no real title available?)
- scientific article; zbMATH DE number 1241843 (Why is no real title available?)
- scientific article; zbMATH DE number 1786530 (Why is no real title available?)
- Illumination in the presence of opaque line segments in the plane
- Illuminating rectangles and triangles on the plane
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028896)