Illuminating labyrinths.
From MaRDI portal
Publication:1428567
DOI10.1016/S0166-218X(03)00296-8zbMath1049.52006OpenAlexW2913956996MaRDI QIDQ1428567
Publication date: 29 March 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00296-8
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Illuminating rectangles and triangles on the plane
- Lower bounds on the cardinality of the maximum matchings of planar graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Planar Ramsey numbers
- Guarding rectangular art galleries
- A seperation property of plane convex sets.
- Illumination of convex discs
- Illumination in the presence of opaque line segments in the plane