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 条
  • [21] Simultaneous coloring of vertices and incidences of graphs
    Mozafari-Nia, Mahsa
    Iradmusa, Moharram Nejad
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2023, 85 : 287 - 307
  • [22] On Graphs with Cut Vertices and Cut Edges
    Fang, Kun Fu
    Shu, Jin Long
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2014, 30 (03) : 539 - 546
  • [23] On Graphs with Cut Vertices and Cut Edges
    Kun Fu FANG
    Jin Long SHU
    Acta Mathematica Sinica(English Series), 2014, 30 (03) : 539 - 546
  • [24] Numbers of vertices and edges of magic graphs
    Trenkler, M
    ARS COMBINATORIA, 2000, 55 : 93 - 96
  • [25] ORBITS ON VERTICES AND EDGES OF FINITE GRAPHS
    BUSET, D
    DISCRETE MATHEMATICS, 1985, 57 (03) : 297 - 299
  • [26] On list backbone coloring of graphs
    Pimpasalee, Wannapol
    Nakprasit, Keaitsuda Maneeruk
    ARS COMBINATORIA, 2018, 140 : 123 - 134
  • [27] On the list dynamic coloring of graphs
    Akbari, S.
    Ghanbari, M.
    Jahanbekam, S.
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (14) : 3005 - 3007
  • [28] Sum List Coloring Graphs
    Adam Berliner
    Ulrike Bostelmann
    Richard A. Brualdi
    Louis Deaett
    Graphs and Combinatorics, 2006, 22 : 173 - 183
  • [29] On graphs with cut vertices and cut edges
    Kun Fu Fang
    Jin Long Shu
    Acta Mathematica Sinica, English Series, 2014, 30 : 539 - 546
  • [30] List coloring Halin graphs
    Wang, WF
    Lih, KW
    ARS COMBINATORIA, 2005, 77 : 53 - 63