Colouring polygon visibility graphs and their generalizations

被引:0
|
作者
机构
[1] Davies, James
[2] Krawczyk, Tomasz
[3] McCarty, Rose
[4] Walczak, Bartosz
来源
Davies, James; Krawczyk, Tomasz; McCarty, Rose; Walczak, Bartosz | 2021年 / Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing卷 / 189期
关键词
723.5 Computer Applications - 741.2 Vision - 921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory - 921.6 Numerical Methods;
D O I
暂无
中图分类号
学科分类号
摘要
35
引用
收藏
相关论文
共 50 条
  • [21] COMPUTING THE VISIBILITY POLYGON FROM AN EDGE
    LEE, DT
    LIN, AK
    COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 34 (01): : 1 - 19
  • [22] Colouring exact distance graphs of chordal graphs
    Quiroz, Daniel A.
    DISCRETE MATHEMATICS, 2020, 343 (05)
  • [23] An algorithm for visibility computation of points in polygon
    Yang, C. (chl_yang@sdu.edu.cn), 1600, Institute of Computing Technology (25):
  • [24] Visibility concepts in orthogonal polygon recognition
    Poorna, B
    Easwarakumar, KS
    PATTERN RECOGNITION LETTERS, 2001, 22 (10) : 1153 - 1159
  • [25] Colouring AT-Free Graphs
    Kratsch, Dieter
    Mueller, Haiko
    ALGORITHMS - ESA 2012, 2012, 7501 : 707 - 718
  • [26] Colouring random regular graphs
    Shi, Lingsheng
    Wormald, Nicholas
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (03): : 459 - 494
  • [27] Facial Homogeneous Colouring of Graphs
    Madaras, Tomas
    Surimova, Maria
    SYMMETRY-BASEL, 2021, 13 (07):
  • [28] On the edge colouring of bipartite graphs
    Magomedov, A. M.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2009, 19 (01): : 81 - 87
  • [29] Game list colouring of graphs
    Borowiecki, M.
    Sidorowicz, E.
    Tuza, Zs.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2007, 14 (01):
  • [30] The Colouring Number of Infinite Graphs
    Bowler, Nathan
    Carmesin, Johannes
    Komjath, Peter
    Reiher, Christian
    COMBINATORICA, 2019, 39 (06) : 1225 - 1235