S. Darbinyan

activity

20242026

collaborators

3 papers

math.CO2026

Sufficient conditions for a digraph to contain: a pre-Hamiltonian cycle and cycles of lengths 3 and 4

Samvel Kh. Darbinyan

Let $D$ be a digraph of order $p \geq 5$ with minimum degree at least $p - 1$ and with minimum semi-degree at least $p /2 - 1$ . In his excellent and renowned paper, ``Long Cycles in Digra…

math.CO2025

On Hamiltonian bypasses in digraphs and bipartite digraphs

Samvel Kh. Darbinyan

A Hamiltonian path in a digraph $D$ in which the initial vertex dominates the terminal vertex is called a Hamiltonian bypass. Let $D$ be a 2-strong digraph of order $p \geq 3$ and l…

math.CO2024

A new sufficient condition for a 2-strong digraph to be Hamiltonian

Samvel Kh. Darbinyan

In this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n \geq 9$ . If $n - 1$ vertices of $D$ have…