Perfect graphs and guarding rectilinear art galleries

DOI10.1007/S00454-014-9587-4zbMATH Open1294.05049OpenAlexW2069841121MaRDI QIDQ2249473FDOQ2249473

Authors: Jens Maßberg 

Publication date: 1 July 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-014-9587-4

Recommendations

• scientific article; zbMATH DE number 177851
• An alternative proof of the rectilinear art gallery theorem
• Traditional Galleries Require Fewer Watchmen
• Art gallery theorems for guarded guards.
• Edge guards in rectilinear polygons

zbMATH Keywords

polyominoespacking numberperfect graphsrectilinear art gallery problem

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Polyominoes (05B50) Perfect graphs (05C17)

Cites Work

• Normal hypergraphs and the perfect graph conjecture
• A short proof of Chvatal's Watchman Theorem
• Title not available (Why is that?)
• Traditional Galleries Require Fewer Watchmen
• Title not available (Why is that?)
• An alternative proof of the rectilinear art gallery theorem
• A combinatorial theorem in plane geometry
• The art gallery theorem for polyominoes
• A Short Proof of the Rectilinear Art Gallery Theorem
• A Class of Perfect Graphs

Cited In (6)

• Title not available (Why is that?)
• Art gallery theorems for guarded guards.
• Guarding polyominoes, polycubes and polyhypercubes
• The art gallery theorem for polyominoes
• The smallest art gallery not guarded by every third vertex
• Guarding polyominoes

This page was built for publication: Perfect graphs and guarding rectilinear art galleries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249473)