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
来源：
NUMERICAL ANALYSIS AND APPLIED MATHEMATICS | 2007年 / 936卷
关键词：
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 条
  • [41] A GRASP for Coloring Sparse Graphs
    Manuel Laguna
    Rafael Martí
    Computational Optimization and Applications, 2001, 19 : 165 - 178
  • [42] Coloring graphs with sparse neighborhoods
    Alon, N
    Krivelevich, M
    Sudakov, B
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 77 (01) : 73 - 82
  • [43] A GRASP for coloring sparse graphs
    Laguna, M
    Martí, R
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2001, 19 (02) : 165 - 178
  • [44] Coloring vertices and faces of locally planar graphs
    Albertson, Michael O.
    Mohar, Bojan
    GRAPHS AND COMBINATORICS, 2006, 22 (03) : 289 - 295
  • [45] A common asymptotic behavior for different classes of sparse labelled graphs with given number of vertices and edges
    Ravelomanana, V
    Thimonier, L
    FORMAL POWER SERIES AND ALGEBRAIC COMBINATORICS, 2000, : 309 - 319
  • [46] Dynamic coloring and list dynamic coloring of planar graphs
    Kim, Seog-Jin
    Lee, Sang June
    Park, Won-Jin
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2207 - 2212
  • [47] Odd coloring of sparse graphs and planar graphs
    Cho, Eun-Kyung
    Choi, Ilkyoo
    Kwon, Hyemin
    Park, Boram
    DISCRETE MATHEMATICS, 2023, 346 (05)
  • [48] Drawing Graphs with Vertices and Edges in Convex Position
    Garcia-Marco, Ignacio
    Knauer, Kolja
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2015, 2015, 9411 : 348 - 359
  • [49] Drawing graphs with vertices and edges in convex position
    Garcia-Marco, Ignacio
    Knauer, Kolja
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2016, 58 : 25 - 33
  • [50] Constructing graphs with several pseudosimilar vertices or edges
    Lauri, J
    DISCRETE MATHEMATICS, 2003, 267 (1-3) : 197 - 211
12345