A sufficient condition for cyclability in directed graphs Original Research Article

Given a strongly connected digraph image of order image and a subset image of image, we prove that if any two nonadjacent vertices of image have degree sum at least image, there is a directed cycle in image that contains all the vertices of image. This result generalizes the theorem of Meyniel on hamiltonicity.