Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Krzysztof Giaro, Marek Kubale · Discussiones Mathematicae Graph Theory · 2009
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 ap-proach to arbitrary graphs with bounded cyclomatic numbers and to their multicolorings.