On Interval Colorings of Complete k-partite Graphs K_{n}^{k}
Problems of existence, construction and estimation of parameters of interval colorings of complete k-partite graphs K_{n}^{k} are investigated.
cs.DM↗
arXiv subjects
Rafael R. Kamalian
Publications and source records attributed to Rafael R. Kamalian.
Interval Colourings of Some Regular Graphs
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
cs.DM↗
On Lower Bound for W(K_{2n})
The lower bound W(K_{2n})>=3n-2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K_{2n}.
cs.DM↗