6 citations · 9 across the 5 of their papers we have counts for
6 papers
On a Problem of Wang Concerning the Hamiltonicity of Bipartite Digraphs
Samvel Kh. Darbinyan, Iskandar A. Karapetyan
R. Wang (Discrete Mathematics and Theoretical Computer Science, vol. 19(3), 2017) proposed the following problem. \textbf{Problem.} Let be a strongly connected balanced biparti…
A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs
Samvel Kh. Darbinyan, Iskandar A. Karapetyan
Let be a strongly connected balanced bipartite directed graph of order other than a directed cycle. Let be distinct vertices in . dominates a ver…
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…
A Note on Long non-Hamiltonian Cycles in One Class of Digraphs
S. Kh. Darbinyan, I. A. Karapetyan
Let be a strong digraph on vertices. In [3, Discrete Applied Math., 95 (1999) 77-87)], J. Bang-Jensen, Y. Guo and A. Yeo proved the following theorem: if (*) $d(x)+d(…
On longest non-Hamiltonian Cycles in Digraphs with the Conditions of Bang-Jensen, Gutin and Li
S. Kh. Darbinyan, I. A. Karapetyan
Let be a strong digraph on vertices. In [2, J. Graph Theory 22 (2) (1996) 181-187)], J. Bang-Jensen, G. Gutin and H. Li proved the following theorems: If (*) $d(x)+d(…