On colourability of polygon visibility graphs
From MaRDI portal
Publication:6181985
DOI10.1016/J.EJC.2023.103820OpenAlexW2949783980MaRDI QIDQ6181985FDOQ6181985
Onur Çağırıcı, Petr Hliněný, Bodhayan Roy
Publication date: 23 January 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2023.103820
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A game of cops and robbers
- Visibility Algorithms in the Plane
- Some NP-hard polygon decomposition problems
- On k-visibility graphs
- An optimal visibility graph algorithm for triangulated simple polygons
- On the chromatic number of the visibility graph of a set of points in the plane
- COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
- Visibility graphs of point sets in the plane
- Computational complexity of art gallery problems
- Hiding people in polygons
- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
- The vertex-edge visibility graph of a polygon
- Title not available (Why is that?)
- On colouring point visibility graphs
- On Colourability of Polygon Visibility Graphs
- Improved bounds for the conflict-free chromatic art gallery problem
- Computing the maximum clique in the visibility graph of a simple polygon
This page was built for publication: On colourability of polygon visibility graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181985)
