Longest paths and cycles in bipartite oriented graphs
Zhang Ke Min · Journal of Graph Theory · 1987
Abstract In this paper we obtain two sufficient conditions, Ore type (Theorem 1) and Dirac type (Theorem 2), on the degrees of a bipartite oriented graph for ensuring the existence of long paths and cycles. These conditions are shown to be the best possible in a sense.