PERFORMANCE OF ALGORITHMS FOR COLOURING PLANAR GRAPHS.

被引：0
|
作者：
Williams, M.H.
Milne, K.T.
机构：
来源：
| 1600年 / 27期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
下载
收藏
相关论文
共 50 条
  • [1] Algorithms and experiments on colouring squares of planar graphs
    Andreou, MI
    Nikoletseas, SE
    Spirakis, PG
    EXPERIMENTAL AND EFFICIENCT ALGORITHMS, PROCEEDINGS, 2003, 2647 : 15 - 32
  • [2] ALGORITHMS ON MARKED DIRECTED GRAPHS.
    Comeau, M.A.
    Thulasiraman, K.
    Canadian electrical engineering journal, 1984, 9 (02): : 72 - 79
  • [3] Colouring and labelling of planar graphs
    Van den Heuvel, Y
    McGuinness, S
    ELECTROMAGNETIC COMPATIBILITY 1998, 1998, : 712 - 715
  • [4] PARALLEL ALGORITHMS FOR DEPTH-FIRST SEARCHES I. PLANAR GRAPHS.
    Smith, Justin R.
    1600, (15):
  • [5] THE PERFORMANCE OF ALGORITHMS FOR COLORING PLANAR GRAPHS
    WILLIAMS, MH
    MILNE, KT
    COMPUTER JOURNAL, 1984, 27 (02): : 165 - 170
  • [6] Multiple list colouring of planar graphs
    Zhu, Xuding
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 122 : 794 - 799
  • [7] Acyclic colouring of 1-planar graphs
    Borodin, OV
    Kostochka, AV
    Raspaud, A
    Sopena, E
    DISCRETE APPLIED MATHEMATICS, 2001, 114 (1-3) : 29 - 41
  • [8] List 4-colouring of planar graphs
    Zhu, Xuding
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2023, 162 : 1 - 12
  • [9] List 4-colouring of planar graphs
    Zhu, Xuding
    arXiv, 2022,
  • [10] COLOURING PLANAR GRAPHS WITH BOUNDED MONOCHROMATIC COMPONENTS
    Glebov, A. N.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2020, 17 : 513 - 520
12345