- hamiltonian graphs
- bipartite graphs
- edge colorings of graphs
- interconnection between local and global properties of graphs
- applications of Graph Theory

- timetabling

** Graph Theory**

- 1. New local conditions for a graph to be hamiltonian,
Graphs and Combinatorics, 22 (2006) 153-160

- 2. Some results on an edge coloring problem of Folkman and Fulkerson, Discrete Mathematics, 223 (2000) 13-25

- 3. Bipartite graphs and their
applications, Cambridge Tracts in Mathematics 131, Cambridge
University Press, 1998, 272 pp. (coauthors T.M.J. Denley and R. Häggkvist)

- 4. Every 3-connected, locally connected claw-free graph is Hamilton-
connected, J. Graph Theory, 23 (1996), 191-201

- 5. A characterization of panconnected
graphs satisfying a local Ore - type condition, J. Graph Theory, 22 (1996), 95-103 (coauthors R. Häggkvist and G.V.Sarkisian)

- 6. On graphs satisfying a
local Ore - type condition, J. Graph Theory, 21(1996), 1-10
(coauthors H.J.Broersma, J.van den Heuvel and H.J.Veldman)

- 7. Stable properties of graphs, Discrete Math. 90 (1991) 143-152 (coauthor N.K.Khachatrian)

- 8. Some localization theorems on hamiltonian
circuits, J. of Combinatorial Theory Series B 49 (1990) 287 - 294 (coauthor N.K.Khachatrian)

- 9. Investigation on interval edge colorings of graphs. J. Combinatorial Theory Ser. B, 62(1994) 34-43 (coauthor R.R.Kamalian)

- 10. Counterexamples to the Kotzig problem (in Russian ),
Diskretnaja Matematika, 4 (1992) 96-98 (coauthor A.N.Mirumyan)

- 11. Transformations of edge colorings of a bipartite multigraph and their applications,
Soviet Math. Doclady, v.43, no.1, 1991 (coauthor A.N.Mirumyan)

- 12. A criterion for the unique edge
colorability of bipartite multigraphs (in Russian), Metody Diskret. Analiz, no.45 (1987),
3-20 (coauthors A.V.Kostochka and A.N.Mirumyan)

** Combinatorics**

- 1. Compatible systems of distinct representatives (in Russian), Diskret. Analiz,
no.27, 1975,3-12

- 2. Estimation of the number of compatible systems of distinct
representatives (in Russian), Applied Math., no.1, 14-21,Yerevan Univ., 1981

- 3. Transformations of Latin squares (in Russian),
Diskretnaja Matem. 2(1990), no.3, 21-28 (coauthor A.N.Mirumyan)

- 4. On the number of nearly perfect matchings in almost regular uniform hypergraphs,
Discrete Math., 207 (1999) 1-8 (coauthor N.N. Kuzjurin)

- 5. On the number of partial Steiner systems,
Journal of Combinatorial Designs, 8 (2000) 347-352 (coauthor N.N. Kuzjurin)

** Operations research **

- 1. Transformations of school timetables (in Russian ), Mat. voprosy kybernetiky, no.4, 93-110, "Nauka", Moscow, 1992
(coauthor A.N.Mirumyan)

- 2. A generalized class-teacher model for some timetabling
problems, European Journal of Operational Research, 143 (2002) 531-542
(coauthor D.de Werra)

- 3. New class of 0-1 integer programs with
tight approximation via linear relaxations,
Mathematical Methods of Operations Research, 53 (2001), 363-370
(coauthor N.N. Kuzjurin)