Efficient list cost Coloring of vertices and/or edges of some sparse graphs

被引:0
|
作者
Giaro, Krzysztof [1 ]
Kubale, Marek [1 ]
机构
[1] Gdansk Univ Technol, Dept Algorithms & Syst Modeling, Gdansk, Poland
关键词
chromatic number; graph coloring; polynomial algorithm; tree;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider a list cost coloring of vertices and edges in the model of vertex, edge, total and pseudototal coloring of graphs. We use a dynamic programming approach to derive polynomial-time algorithms for solving the above problems for trees. Then we generalize this approach to arbitrary graphs with bounded cyclomatic numbers.
引用
收藏
页码:241 / +
页数:2
相关论文
共 50 条
  • [1] LINEAR LIST COLORING OF SOME SPARSE GRAPHS
    Chen, Ming
    Li, Yusheng
    Zhang, Li
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (01) : 51 - 64
  • [2] List Dynamic Coloring of Sparse Graphs
    Kim, Seog-Jin
    Park, Won-Jin
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 156 - 162
  • [3] STRUCTURE OF NEIGHBORHOODS OF EDGES IN PLANAR GRAPHS AND SIMULTANEOUS COLORING OF VERTICES, EDGES AND FACES
    BORODIN, OV
    MATHEMATICAL NOTES, 1993, 53 (5-6) : 483 - 489
  • [4] List star edge coloring of sparse graphs
    Kerdjoudj, Samia
    Raspaud, Andre
    DISCRETE APPLIED MATHEMATICS, 2018, 238 : 115 - 125
  • [5] List r-dynamic coloring of sparse graphs
    Zhu, Junlei
    Bu, Yuehua
    THEORETICAL COMPUTER SCIENCE, 2020, 817 (817) : 1 - 11
  • [6] LIST (p,q)-COLORING OF SPARSE PLANE GRAPHS
    Borodin, O. V.
    Ivanova, A. O.
    Neustroeva, T. K.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2006, 3 : 355 - 361
  • [7] k-frugal List Coloring of Sparse Graphs
    Fang Q.
    Zhang L.
    Tongji Daxue Xuebao/Journal of Tongji University, 2022, 50 (12): : 1825 - 1832
  • [8] List-coloring squares of sparse subcubic graphs
    Dvorak, Zdenek
    Skrekovski, Riste
    Tancer, Martin
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 22 (01) : 139 - 159
  • [9] List coloring the square of sparse graphs with large degree
    Bonamy, Marthe
    Leveque, Benjamin
    Pinlou, Alexandre
    EUROPEAN JOURNAL OF COMBINATORICS, 2014, 41 : 128 - 137
  • [10] 5-list-coloring planar graphs with distant precolored vertices
    Dvorak, Zdenek
    Lidicky, Bernard
    Mohar, Bojan
    Postle, Luke
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 122 : 311 - 352