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
来源：
DISCRETE APPLIED MATHEMATICS | 2020年 / 286卷 / 78-90期
关键词：
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
相关论文
共 50 条
  • [1] On Colouring Point Visibility Graphs
    Diwan, Ajit Arvind
    Roy, Bodhayan
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, 2017, 10156 : 156 - 165
  • [2] Colouring polygon visibility graphs and their generalizations
    Davies, James; Krawczyk, Tomasz; McCarty, Rose; Walczak, Bartosz, 2021, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing (189):
  • [3] Some results on point visibility graphs
    Ghosh, Subir Kumar
    Roy, Bodhayan
    THEORETICAL COMPUTER SCIENCE, 2015, 575 : 17 - 32
  • [4] Recognition and Complexity of Point Visibility Graphs
    Jean Cardinal
    Udo Hoffmann
    Discrete & Computational Geometry, 2017, 57 : 164 - 178
  • [5] Recognition and Complexity of Point Visibility Graphs
    Cardinal, Jean
    Hoffmann, Udo
    DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 57 (01) : 164 - 178
  • [6] Visibility Graphs of Point Sets in the Plane
    Florian Pfender
    Discrete & Computational Geometry, 2008, 39 : 455 - 459
  • [7] Visibility graphs of point sets in the plane
    Pfender, Florian
    DISCRETE & COMPUTATIONAL GEOMETRY, 2008, 39 (1-3) : 455 - 459
  • [8] Some Results on Point Visibility Graphs
    Ghosh, Subir Kumar
    Roy, Bodhayan
    ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, 8344 : 163 - 175
  • [9] Computational complexity aspects of point visibility graphs
    Himmel, Anne-Sophie
    Hoffmann, Clemens
    Kunz, Pascal
    Froese, Vincent
    Sorge, Manuel
    DISCRETE APPLIED MATHEMATICS, 2019, 254 : 283 - 290
  • [10] Point visibility graphs and O-convex cover
    Bremner, D
    Shermer, T
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2000, 10 (01) : 55 - 71
12345