6 citations · 12 across the 7 of their papers we have counts for
11 papers · 1 filter
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…
Cycles of many lengths in digraphs with Meyniel-like condition
Samvel Kh. Darbinyan
C. Thomassen (Proc. London Math. Soc. (3) 42 (1981), 231-251) gave a characterization of strongly connected non-Hamiltonian digraphs of order with minimum degree . I…
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 theorem on even pancyclic bipartite digraphs
Samvel Kh. Darbinyan
We prove that a strongly connected balanced bipartite directed graph of order with partite sets and contains cycles of every length , provided…
On Hamiltonian and Hamilton-connected digraphs
S. Kh. Darbinyan
C. Thomassen in \cite{[11]} suggested (see also \cite{[2]}, J. C.Bermond, C. Thomassen, Cycles in Digraphs - A survey, J. Graph Theory 5 (1981) 1-43, Conjectures 1.6.7 and 1.6.8) t…
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…