On some Problems in Graph Theory

Authors

  • Iskandar A. Karapetyan Institute for Informatics and Automation Problems of NAS RA

Abstract

  

References

С.Х. Дарбинян и И.А. Карапетян, О вершинной панцикличности направленных графов с большими полустепенями. Мат. воп. киб. и выч. тех., №29, с. 66-84, 2007.

S.Kh. Darbinyan and I.A. Karapetyan, A note on short paths in oriented graphs, Mathematical Problems of Computer Sciences 33 (2010) 35-40.

И.А. Карапетян и С.Х. Дарбинян, Однарядная трассировка. CSIT Conference, September 2007, Yerevan, Armenia.

И.А. Карапетян и С.Х. Дарбинян, О двух задачах трассировки, Computer Sciense and Information Technologies, 28 September – 2 October, p. 439-442, 2009, Yerevan, Armenia. 36

Zh.G. Nikoghosyan, Dirac-type generalizations concerning large cycles in graphs, Discrete Mathematics 309 (2009) 1925-1930.

M.Zh. Nikoghosyan, Zh.G. Nikoghosyan, Large cycles in 4-connected graphs, Discrete Mathematics 311, no.4 (2011) 302-306.

R.R. Kamalian, V.V. Mkrtchyan, On special maximum matchings constructing, Discrete Mathematics 308, 2008, pp 1792-1800.

R.R. Kamalian, On a number of colors in cyclically interval edge colorings of trees, LiTH-MAT-R-2010/09-SE, Linkoping University, 2010.

P.A. Petrosyan, Interval edge-colorings of complete graphs and n  dimensional cubes, Discrete Mathematics 310, 2010, pp. 1580-1587.

P.A. Petrosyan, H.Z. Arakelyan, V.M. Baghdasaryan, A generalization of interval edgecolorings of graphs, Discrete Applied Mathematics 158, 2010, pp. 1827-1837.

Downloads

Published

2021-12-10

How to Cite

Karapetyan, I. A. . (2021). On some Problems in Graph Theory. Mathematical Problems of Computer Science, 34, 35–36. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/315