TY - GEN
A1 - Darbinyan Samvel Kh.
PB - DMTCS
N2 - In this paper, we confirm this conjecture. Moreover, we prove that if a digraph D satisfies the conditions of this conjecture and has a pair of non-adjacent vertices {x, y} such that d(x) + d(y) 2n − 4, then D contains cycles of all lengths 3, 4, . . . , n.
L1 - http://noad.sci.am/Content/136199/Samvel+Darbinyan%2C+A+new+sufficient+condition+for+a+digraph+to+be+Hamiltonian.pdf
L2 - http://noad.sci.am/Content/136199
T1 - A new sufficient condition for a digraph to be Hamiltonian−A proof of Manoussakis conjecture
UR - http://noad.sci.am/dlibra/docmetadata?id=136199
ER -