On Colourability of Polygon Visibility Graphs

DOI10.4230/LIPIcs.FSTTCS.2017.21zbMath1491.68256arXiv1906.01904MaRDI QIDQ5136313

Petr Hliněný, Bodhayan Roy, Onur Çağırıcı

Publication date: 25 November 2020

Full work available at URL: https://arxiv.org/abs/1906.01904

zbMATH Keywords

graph coloring; NP-completeness; polygon visibility graph

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)