Improved bounds for the conflict-free chromatic art gallery problem
DOI10.1145/2582112.2582117zbMATH Open1395.68286OpenAlexW2003554749MaRDI QIDQ4635537FDOQ4635537
Matúš Mihalák, Peter Widmayer, Thomas Tschager, Subir Kumar Ghosh, Andreas Bärtschi
Publication date: 23 April 2018
Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2582112.2582117
Recommendations
- Conflict-free chromatic art gallery coverage
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Conflict-free chromatic art gallery coverage
- On conflict-free chromatic guarding of simple polygons
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cited In (10)
- On Conflict-Free Multi-coloring
- Erratum to: ``Conflict-free chromatic art gallery coverage
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Conflict-Free Coloring of Intersection Graphs
- Title not available (Why is that?)
- Conflict-free chromatic art gallery coverage
- On colourability of polygon visibility graphs
- The dispersive art gallery problem
- On Colourability of Polygon Visibility Graphs
- Coloring polygon visibility graphs and their generalizations
This page was built for publication: Improved bounds for the conflict-free chromatic art gallery problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635537)
