S. Darbinyan

activity

20122025

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

6 citations · 12 across the 7 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

Sufficient conditions for Hamiltonian cycles in bipartite digraphs

Samvel Kh. Darbinyan

We prove two sharp sufficient conditions for hamiltonian cycles in balanced bipartite directed graph. Let $D$ be a strongly connected balanced bipartite directed graph of order $2a…

math.CO2016

On cyclability of digraphs

Samvel Kh. Darbinyan

Given a directed graph $D$ of order $n \geq 4$ and a nonempty subset $Y$ of vertices of $D$ such that in $D$ every vertex of $Y$ reachable from every other vertex of $Y$ . Assume tha…