On the complexity of a restricted list-coloring problem

被引：0
|
作者：
机构：
来源：
Discrete Math | / 1-3卷 / 103-109期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] On the complexity of a restricted list-coloring problem
    Dror, M
    Finke, G
    Gravier, S
    Kubiak, W
    [J]. DISCRETE MATHEMATICS, 1999, 195 (1-3) : 103 - 109
  • [2] On a list-coloring problem
    Gravier, S
    Maffray, F
    Mohar, B
    [J]. DISCRETE MATHEMATICS, 2003, 268 (1-3) : 303 - 308
  • [3] Exploring the complexity boundary between coloring and list-coloring
    Flavia Bonomo
    Guillermo Durán
    Javier Marenco
    [J]. Annals of Operations Research, 2009, 169 : 3 - 16
  • [4] Exploring the complexity boundary between coloring and list-coloring
    Bonomo, Flavia
    Duran, Guillermo
    Marenco, Javier
    [J]. ANNALS OF OPERATIONS RESEARCH, 2009, 169 (01) : 3 - 16
  • [5] Between coloring and list-coloring: μ-coloring
    Bonomo, Flavia
    Cecowski Palacio, Mariano
    [J]. ARS COMBINATORIA, 2011, 99 : 383 - 398
  • [6] Some (in)tractable Parameterizations of Coloring and List-Coloring
    Arora, Pranav
    Banik, Aritra
    Paliwal, Vijay Kumar
    Raman, Venkatesh
    [J]. FRONTIERS IN ALGORITHMICS (FAW 2018), 2018, 10823 : 126 - 139
  • [7] On list-coloring outerplanar graphs
    Hutchinson, Joan P.
    [J]. JOURNAL OF GRAPH THEORY, 2008, 59 (01) : 59 - 74
  • [8] List-coloring embedded graphs
    Dvorak, Zdenek
    Kawarabayashi, Ken-ichi
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1004 - 1012
  • [9] List-coloring the square of a subcubic graph
    Cranston, Daniel W.
    Kim, Seog-Jin
    [J]. JOURNAL OF GRAPH THEORY, 2008, 57 (01) : 65 - 87
  • [10] List-coloring - Parameterizing from triviality
    Arora, Pranav
    Banik, Aritra
    Paliwal, Vijay Kumar
    Raman, Venkatesh
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 821 : 102 - 110
12345