Sciweavers

ALGORITHMICA
2004
150views more  ALGORITHMICA 2004»
13 years 11 months ago
Sum Coloring of Bipartite Graphs with Bounded Degree
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
Michal Malafiejski, Krzysztof Giaro, Robert Jancze...