On colourability of polygon visibility graphs
From MaRDI portal
(Redirected from Publication:6181985)
On colourability of polygon visibility graphs (scientific article; zbMATH DE number 7793117)
On colourability of polygon visibility graphs (scientific article; zbMATH DE number 7793117)
Recommendations
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A game of cops and robbers
- An optimal visibility graph algorithm for triangulated simple polygons
- COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
- Computational complexity of art gallery problems
- Computing the maximum clique in the visibility graph of a simple polygon
- Hiding people in polygons
- Improved bounds for the conflict-free chromatic art gallery problem
- On k-visibility graphs
- On colourability of polygon visibility graphs
- On the chromatic number of the visibility graph of a set of points in the plane
- Some NP-hard polygon decomposition problems
- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
- The vertex-edge visibility graph of a polygon
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Visibility Algorithms in the Plane
- Visibility graphs of point sets in the plane
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)
