On colouring point visibility graphs

  title={On colouring point visibility graphs},
  author={Ajit A. Diwan and Bodhayan Roy},
In this paper we show that it can be decided in polynomial time whether or not the visibility graph of a given point set is 4-colourable, and such a 4-colouring, if it exists, can also be constructed in polynomial time. We show that the problem of deciding whether the visibility graph of a point set is 5-colourable, is NP-complete. We give an example of a point visibility graph that has chromatic number 6 while its clique number is only 4. 

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 17 references

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane

Discrete & Computational Geometry • 2005
View 16 Excerpts
Highly Influenced

Point visibility graph recognition is NP-hard

Int. J. Comput. Geometry Appl. • 2016
View 1 Excerpt

On planar point sets with the pentagon property

Symposium on Computational Geometry • 2013
View 2 Excerpts

On the Connectivity of Visibility Graphs

Discrete & Computational Geometry • 2012
View 1 Excerpt

Visibility Algorithms in the Plane

S. K. Ghosh
View 1 Excerpt

Visibility graphs of point sets in the plane

Electronic Notes in Discrete Mathematics • 2006
View 3 Excerpts

Similar Papers

Loading similar papers…