On colouring point visibility graphs

DOI10.1007/978-3-319-53007-9_14MaRDI QIDQ6828122zbMATH OpenFDO

Authors Ajit A. Diwan, Bodhayan Roy

Publication date 7 April 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-53007-9_14

zbMATH Keywords

chromatic numbergraph colouringNP-completenesspoint setpoint visibility graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: On colouring point visibility graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828122)