Problems of existence, construction and estimation of parameters of interval colorings of complete k-partite graphs K_{n}^{k} are investigated.
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
