A k-edge-weighting w of a graph G is an assignment of integer weight, w(e) ? {1, 2, . . . , k}, to each edge e. A k-edge-weighting w induces a vertex coloring c by defining c(u) = P u?e w(e) for every u ? V (G), where u ? ...