Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs

DOI10.7151/dmgt.1452zbMath1194.05039OpenAlexW2089508123MaRDI QIDQ3559384

Marek Kubale, Krzysztof Giaro

Publication date: 14 May 2010

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2b09dddb0d4117424b20950d7d6994b8084a0f45

zbMATH Keywords

dynamic programmingNP-completenesspolynomial-time algorithmlist coloringcost coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) ⋮ Consensus models: computational complexity aspects in modern approaches to the list coloring problem

This page was built for publication: Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs