Get started
Author

Samvel Kh. Darbinyan

Observed names: Darbinyan, S. Kh., Darbinyan, Samvel Kh., S. Darbinyan, S. Kh. Darbinyan, S.Kh. Darbinyan, Samvel Darbinyan, Самвел Х. Дарбинян
ORCID: 0009-0000-1823-0806
Observed ORCID: 0009-0000-1823-0806
OpenAlex ID: A5034851775
A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
2011 · Darbinyan, S. Kh. · arXiv (Cornell University) · 17
PDF
Sufficient conditions for Hamiltonian cycles in bipartite digraphs
2018 · Samvel Kh. Darbinyan · Discrete Applied Mathematics · 15
On the pancyclicity of digraphs with large semi-degrees
2011 · Darbinyan, S. Kh. · arXiv (Cornell University) · 11
PDF
A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
2021 · Samvel Kh. Darbinyan · Discrete Mathematics & Theoretical Computer Science · 9
PDF
On Hamiltonian bypasses in digraphs with the condition of Y. Manoussakis
2015 · Samvel Kh. Darbinyan · Computer Science and Information Technologies (CSIT) · 8
On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
2016 · S.Kh. Darbinyan, I.A. Karapetyan · Discrete Applied Mathematics · 7
A note on long non-hamiltonian cycles in one class of Digraphs
2013 · Samvel Kh. Darbinyan, Iskandar A. Karapetyan · Computer Science and Information Technologies (CSIT) · 7
PDF
On Three Conjectures of Thomassen and the Extremal Digraphs for Two Conjectures of Nash‐Williams
2025 · Samvel Kh. Darbinyan · Journal of Graph Theory · 5
PDF
A Note on Hamiltonian Bypasses in Digraphs with Large Degrees
2020 · Samvel Darbinyan · Mathematical Problems of Computer Science · 5
PDF
On Hamiltonian and Hamilton-connected digraphs
2018 · Darbinyan, S. Kh. · arXiv (Cornell University) · 5
PDF
Sufficient conditions for a balanced bipartite digraph to be even pancyclic
2018 · Samvel Kh. Darbinyan · Discrete Applied Mathematics · 5
PDF
A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs
2017 · Samvel Darbinyan, Iskandar Karapetyan · Computer Science and Information Technologies (CSIT) · 5
PDF
On Hamiltonian Bypasses in one Class of Hamiltonian Digraphs
2014 · Darbinyan, Samvel Kh., Karapetyan, Iskandar A. · arXiv (Cornell University) · 5
PDF
A new sufficient condition for a 2-strong digraph to be Hamiltonian
2024 · Samvel Kh. Darbinyan · Discrete Mathematics & Theoretical Computer Science · 4
On Hamiltonian Cycles in a 2-Strong Digraphs with Large Degrees and Cycles
2024 · S. Kh. Darbinyan · Pattern Recognition and Image Analysis · 3
On an Extension of the Ghouila-Houri Theorem
2022 · Samvel Darbinyan · Mathematical Problems of Computer Science · 3
On pre-Hamiltonian cycles in balanced bipartite digraphs
2017 · Darbinyan, Samvel Kh. · arXiv (Cornell University) · 3
PDF
On pre-Hamiltonian Cycles in Hamiltonian Digraphs
2014 · Darbinyan, Samvel Kh. · arXiv (Cornell University) · 3
PDF
A New Sufficient Condition for a 2-Strong Digraph to Be Hamiltonian
2023 · Samvel Darbinyan · Computer Science and Information Technologies (CSIT) · 2
PDF
On Hamiltonian Bypasses in Digraphs satisfying Meyniel-like Condition
2023 · Darbinyan, Samvel Kh. · arXiv (Cornell University) · 2
PDF
On Cycles through Vertices of Large Semidegree in Digraphs
2014 · Darbinyan, S. Kh., Karapetyan, I. A. · arXiv (Cornell University) · 2
PDF
Thirteen Papers in Algebra
1986 · I. Dmitriev, S. Darbinyan, et al. · Translations - American Mathematical Society/Translations · 2
On Special Suborgraphs in Orgraphs with Large Semidegrees
2025 · Samvel Darbinyan · Pattern Recognition and Image Analysis · 1
A Note on Hamiltonian Cycles in Digraphs with Large Degrees
2023 · Darbinyan, Samvel Kh. · arXiv (Cornell University) · 1
PDF
A Theorem on Even Pancyclic Bipartite Digraphs
2021 · Samvel Darbinyan · Mathematical Problems of Computer Science · 1
Works count: 46
Citation count: 134
H-index: 7
I10-index: 3
Year
Topic
Type