On Colourability of Polygon Visibility Graphs
Combinatorics
2019-06-06 v1 Discrete Mathematics
Abstract
We study the problem of colouring visibility graphs of polygons. In particular, for visibility graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and prove that the 5-colourability question is already NP-complete for them. For visibility graphs of polygons with holes, we prove that the 4-colourability question is NP-complete.
Cite
@article{arxiv.1906.01904,
title = {On Colourability of Polygon Visibility Graphs},
author = {Onur Çağirici and Petr Hliněný and Bodhayan Roy},
journal= {arXiv preprint arXiv:1906.01904},
year = {2019}
}