On Colourability of Polygon Visibility Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F18%3A00100735" target="_blank" >RIV/00216224:14330/18:00100735 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2017.21" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2017.21</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2017.21" target="_blank" >10.4230/LIPIcs.FSTTCS.2017.21</a>

Result language

angličtina

Original language name

On Colourability of Polygon Visibility Graphs

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA17-00837S" target="_blank" >GA17-00837S: Structural properties, parameterized tractability and hardness in combinatorial problems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)

ISBN

9783959770552

ISSN

1868-8969

e-ISSN

—

Number of pages

14

Pages from-to

„21:1-21:14“

Publisher name

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Place of publication

Dagstuhl

Event location

Dagstuhl

Event date

Jan 1, 2018

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—