Sciweavers

71
Voted
CC
2006
Springer
133views System Software» more  CC 2006»
14 years 8 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx