3 citations · 3 across the 6 of their papers we have counts for
6 papers
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…
Cycles of each even lengths in balanced bipartite digraphs
Samvel Kh. Darbinyan
Let be a strongly connected balanced bipartite directed graph of order . Let be distinct vertices in . dominates a vertex if a…
On Hamiltonian Bypasses in Digraphs with the Condition of Y. Manoussakis
Samvel Kh. Darbinyan
Let be a strongly connected directed graph of order vertices which satisfies the following condition for every triple of vertices such that and are no…
On pre-Hamiltonian Cycles in Hamiltonian Digraphs
Samvel Kh. Darbinyan
Let be a strongly connected directed graph of order . In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Supp…
On Cycles through Vertices of Large Semidegree in Digraphs
S. Kh. Darbinyan, I. A. Karapetyan
Let be a strong digraph on vertices. In this paper we show that if contains a cycle of length , then has also a cycle which contains all vertices wi…
On Hamiltonian Bypasses in one Class of Hamiltonian Digraphs
Samvel Kh. Darbinyan, Iskandar A. Karapetyan
Let be a strongly connected directed graph of order which satisfies the following condition (*): for every pair of non-adjacent vertices with a common in-neigh…