On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li. - Samvel Kh. Darbinyan; Iskandar A. Karapetyan (Discret. Appl. Math., 2017)

Sufficient conditions for a balanced bipartite digraph to be even pancyclic. - Samvel Kh. Darbinyan (Discret. Appl. Math., 2018)

Sufficient conditions for Hamiltonian cycles in bipartite digraphs. - Samvel Kh. Darbinyan (Discret. Appl. Math., 2019)

A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture. - Samvel Kh. Darbinyan (Discret. Math. Theor. Comput. Sci., 2020)

On d-panconnected tournaments with large semidegrees. - Samvel Kh. Darbinyan; Gregory Z. Gutin (CoRR, 2021)

On d-panconnected tournaments with large semidegrees. - Samvel Kh. Darbinyan; Gregory Z. Gutin (Discret. Math., 2022)

A new sufficient condition for a 2-strong digraph to be Hamiltonian. - Samvel Kh. Darbinyan (Discret. Math. Theor. Comput. Sci., 2024)

On Hamiltonian bypasses in orgraphs with large semi-degrees. - Samvel Kh. Darbinyan (Discret. Appl. Math., 2025)