共 50 条
On colouring point visibility graphs
被引:0
|作者:
Diwan, Ajit Arvind
[1
]
Roy, Bodhayan
[1
,2
]
机构:
[1] Indian Inst Technol, Dept Comp Sci & Engn, Mumbai, Maharashtra, India
[2] Masaryk Univ, Fac Informat, Brno, Czech Republic
关键词:
Point set;
Visibility graph;
Graph colouring;
D O I:
10.1016/j.dam.2019.01.018
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In this paper we show that it can be decided in polynomial time whether or not the visibility graph of a given point set is 4-colourable, and such a 4-colouring, if it exists, can also be constructed in polynomial time. We show that the problem of deciding whether the visibility graph of a point set is 5-colourable, is NP-complete. We give an example of a point visibility graph that has chromatic number 6 while its clique number is only 4. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:78 / 90
页数:13
相关论文