PERFORMANCE OF ALGORITHMS FOR COLOURING PLANAR GRAPHS.

被引：0
|
作者：
Williams, M.H.
Milne, K.T.
机构：
来源：
| 1600年 / 27期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
下载
收藏
相关论文
共 50 条
  • [21] (Circular) backbone colouring: Forest backbones in planar graphs
    Havet, Frederic
    King, Andrew D.
    Liedloff, Mathieu
    Todinca, Loan
    DISCRETE APPLIED MATHEMATICS, 2014, 169 : 119 - 134
  • [22] Algorithms for colouring random k-colourable graphs
    Subramanian, CR
    COMBINATORICS PROBABILITY & COMPUTING, 2000, 9 (01): : 45 - 77
  • [23] ALGORITHMS FOR ROUTING IN PLANAR GRAPHS
    BECKER, M
    MEHLHORN, K
    ACTA INFORMATICA, 1986, 23 (02) : 163 - 176
  • [24] ISOMORPHISM OF GRAPHS.
    Rao, A.C.
    Journal of the Institution of Engineers (India): Mechanical Engineering Division, 1987, 68 (pt 1-2): : 1 - 4
  • [25] Colouring of generalized signed triangle-free planar graphs
    Jiang, Yiting
    Liu, Daphne Der-Fen
    Yeh, Yeong-Nan
    Zhu, Xuding
    DISCRETE MATHEMATICS, 2019, 342 (03) : 836 - 843
  • [26] Filling the complexity gaps for colouring planar and bounded degree graphs
    Dabrowski, Konrad K.
    Dross, Francois
    Johnson, Matthew
    Paulusma, Daniel
    JOURNAL OF GRAPH THEORY, 2019, 92 (04) : 377 - 393
  • [27] Backbone colouring: Tree backbones with small diameter in planar graphs
    Campos, Victor
    Havet, Frederic
    Sampaio, Rudini
    Silva, Ana
    THEORETICAL COMPUTER SCIENCE, 2013, 487 : 50 - 64
  • [28] List-edge-colouring planar graphs with precoloured edges
    Harrelson, Joshua
    McDonald, Jessica
    Puleo, Gregory J.
    EUROPEAN JOURNAL OF COMBINATORICS, 2019, 75 : 55 - 65
  • [29] A Unified Approach to Distance-Two Colouring of Planar Graphs
    Amini, Omid
    Esperet, Louis
    van den Heuvel, Jan
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 273 - +
  • [30] Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
    Esperet, Louis
    Joret, Gwenael
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (04): : 551 - 570
12345