License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2017.21
URN: urn:nbn:de:0030-drops-83814
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8381/
Go to the corresponding LIPIcs Volume Portal


Cagirici, Onur ; Hlinený, Petr ; Roy, Bodhayan

On Colourability of Polygon Visibility Graphs

pdf-format:
LIPIcs-FSTTCS-2017-21.pdf (0.6 MB)


Abstract

We study the problem of colouring the visibility graphs of polygons. In particular, we provide a polynomial algorithm for 4-colouring of the polygon visibility graphs, and prove that the 6- colourability question is already NP-complete for them.

BibTeX - Entry

@InProceedings{cagirici_et_al:LIPIcs:2018:8381,
  author =	{Onur Cagirici and Petr Hlinen{\'y} and Bodhayan Roy},
  title =	{{On Colourability of Polygon Visibility Graphs}},
  booktitle =	{37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)},
  pages =	{21:1--21:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-055-2},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{93},
  editor =	{Satya Lokam and R. Ramanujam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8381},
  URN =		{urn:nbn:de:0030-drops-83814},
  doi =		{10.4230/LIPIcs.FSTTCS.2017.21},
  annote =	{Keywords: polygon visibility graph, graph coloring, NP-completeness}
}

Keywords: polygon visibility graph, graph coloring, NP-completeness
Seminar: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)
Issue Date: 2018
Date of publication: 26.01.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI