@misc{Darbinyan_Samvel_A,
 author={Darbinyan Samvel},
 howpublished={online},
 language={English},
 abstract={Let D be a strongly connected balanced bipartite directed graph of order 2a ≥ 10 other than a directed cycle. Let x, y be distinct vertices in D. \{x, y\} dominates a vertex z if x → z and y → z; in this case, we call the pair \{x, y\} dominating. In this paper we prove: If max\{d(x), d(y)\} ≥ 2a − 2 for every dominating pair of vertices \{x, y\}, then D contains cycles of all lengths 2, 4, . . . , 2a − 2 or D is isomorphic to a certain digraph of order ten which we specify.},
 title={A Sufficient Condition for pre-Hamiltonian Cycles inBipartite Digraphs},
 type={Conference},
}