k- tuple coloring of a graph G is an assignment of a set of k different colors to each of the vertices of G such that no two adjacent vertices are assigned a common color.We de-note by χk(G)the smallest positive integer n such that G has a k- tuple coloring using n colors.
1)X2(K3)
To see this, note that using only six colors we can assign two colors to each vertex of K3, so that no two adjacent vertices are assigned the same color.
same procedure u will do for next