10 citations · 42 across the 21 of their papers we have counts for
24 papers
Sufficient conditions for a digraph to contain: a pre-Hamiltonian cycle and cycles of lengths 3 and 4
Samvel Kh. Darbinyan
Let be a digraph of order with minimum degree at least and with minimum semi-degree at least . In his excellent and renowned paper, ``Long Cycles in Digra…
On Hamiltonian bypasses in digraphs and bipartite digraphs
Samvel Kh. Darbinyan
A Hamiltonian path in a digraph in which the initial vertex dominates the terminal vertex is called a Hamiltonian bypass. Let be a 2-strong digraph of order and l…
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 be a 2-strong digraph of order . If vertices of have…
A Note on Hamiltonian Cycles in Digraphs with Large Degrees
Samvel Kh. Darbinyan
In this note we prove: {\it Let be a 2-strong digraph of order such that its vertices have degrees at least and the remaining vertex has degree at least $n-…
On Hamiltonian Bypasses in Digraphs satisfying Meyniel-like Condition
Samvel Kh. Darbinyan
Let be a strongly connected directed graph of order . In this paper, we show that if (respectively, ) for every pair of non-ad…
On -panconnected tournaments with large semidegrees
Samvel Kh. Darbinyan, Gregory Z. Gutin
We prove the following new results. (a) Let be a regular tournament of order and a subset of . Suppose that and , are…