On Interval Colorings of Complete k¡ partite Graphs Kk n

Authors

  • Rafayel R. Kamalian Institute for Informatics and Automation Problems of NAS RA
  • Petros A . Petrosyan Institute for Informatics and Automation Problems of NAS RA

Abstract

Problems of existence, construction and estimation of parameters of interval colorings of complete k-partite graphs Kk n are investigated.

References

F. Harary, Graph Theory, Addison-Wesley, Reading, MA , 1969.

V.G.Vizing, The chromatic index of amultigraph, Kibernetika 3(1965) , pp.29-39.

A.A. Zykov,Theory of finite graphs, Novosibirsk,Nauka, 1969.

A .S. A sratian, R.R.Kamalian, Interval colorings of edges of amultigraph,Appl. Math.5(1987) , pp.25-34.

R.R. Kamalian, Interval Edge Colorings of Graphs, Doctoral dissertation, The Institute of Mathematics of the Siberian Branch of the Academy of Sciences of USSR, Novosibirsk, 1990.

P.A . Petrosyan, Interval edge colourings of complete graphs and n-cubes, Abstracts of 5th International Algebraic Conference in Ukraine, Odessa, 2005, p.154.

R. Diestel, Graph Theory, Springer-Verlag, New York, 2000.

D G.Hofan, C.A .Rodger, The chromatic index of complete multipartite graphs, J.Graph Theory 16,(1992) , pp.159-163.

Downloads

Published

2021-12-10

How to Cite

Kamalian, R. R. ., & Petrosyan, P. A. . . (2021). On Interval Colorings of Complete k¡ partite Graphs Kk n. Mathematical Problems of Computer Science, 26, 28–32. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/518

Most read articles by the same author(s)