I am working on a reduction from X to Y.

I have shown that if an instance x is in X

then f(x)= y is in Y. However I have a problem to show it in the reverse
direction.That is if y is in Y then x is in X.
Here is the problem

I have V vertices, and K pairs of vertices (v_i,_v_j)(all V vertices are paired and
any vertex can appear in many pairs) and a number T - colors - such that it is
possible to assign to each vertex a color so that no pair (v_i,v_j) has the same
color: could someone help me to show that I can construct a graph coloring with