The edge-labeling and vertex-colors of Kn

A labeling of the edges of a graph is called vertex-coloring if the labeled degrees of the vertices yield a proper coloring of the graph. In this paper, we show that such a labeling is possible from the label set 1,2,3 for the complete graph Kn, n ≥ 3.