S. Darbinyan

activity

20122025

most citedA Note on Long non-Hamiltonian Cycles in One Class of Digraphs

6 citations · 16 across the 11 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

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 $D$ be a strongly connected balanced biparti…

math.CO2018★ 1 cited

A theorem on even pancyclic bipartite digraphs

Samvel Kh. Darbinyan

We prove that a strongly connected balanced bipartite directed graph of order $2 a \geq 6$ with partite sets $X$ and $Y$ contains cycles of every length $2, 4, \dots, 2 a$ , provided…

math.CO2018★ 1 cited

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…