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.
机构:
Univ Zielona Gora, Fac Math Comp Sci & Econometr, Szafrana 4a, PL-65516 Zielona Gora, PolandUniv Zielona Gora, Fac Math Comp Sci & Econometr, Szafrana 4a, PL-65516 Zielona Gora, Poland
Borowiecka-Olszewska, Marta
Drgas-Burchardt, Ewa
论文数: 0引用数: 0
h-index: 0
机构:
Univ Zielona Gora, Fac Math Comp Sci & Econometr, Szafrana 4a, PL-65516 Zielona Gora, PolandUniv Zielona Gora, Fac Math Comp Sci & Econometr, Szafrana 4a, PL-65516 Zielona Gora, Poland
Drgas-Burchardt, Ewa
Javier-Nol, Nahid Yelene
论文数: 0引用数: 0
h-index: 0
机构:
Univ Nacl Autonoma Mexico, Fac Sci, Av Univ 3000, Mexico City, DF, MexicoUniv Zielona Gora, Fac Math Comp Sci & Econometr, Szafrana 4a, PL-65516 Zielona Gora, Poland
Javier-Nol, Nahid Yelene
Zuazua, Rita
论文数: 0引用数: 0
h-index: 0
机构:
Univ Nacl Autonoma Mexico, Fac Sci, Av Univ 3000, Mexico City, DF, MexicoUniv Zielona Gora, Fac Math Comp Sci & Econometr, Szafrana 4a, PL-65516 Zielona Gora, Poland
机构:
Department of Mathematics, Joykrishnapur High School (H.S.), TamlukDepartment of Mathematics, Joykrishnapur High School (H.S.), Tamluk
Samanta S.
Pramanik T.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, MidnaporeDepartment of Mathematics, Joykrishnapur High School (H.S.), Tamluk
Pramanik T.
Pal M.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, MidnaporeDepartment of Mathematics, Joykrishnapur High School (H.S.), Tamluk