On the existence of a specified cycle in digraphs with constraints on degrees
Abdelhamid Benhocine · Journal of Graph Theory · 1984
Abstract We prove that Woodall's and Ghouila‐Houri's conditions on degrees which ensure that a digraph is Hamiltonian, also ensure that it contains the analog of a directed Hamiltonian cycle but with one edge pointing the wrong way; that is, it contains two vertices that are connected in the same direction by both an edge and a Hamiltonian path.