A note on vertex pancyclic oriented graphs

Let D be an oriented graph of order n greater than or equal to 9, minimum d egree at least n - 2, such that, for the choice of distinct vertices x and y, either xy is an element of E(D) or d(+)(x) + d(-)(y) greater than or equ al to n - 3. Song (J. Graph Theory 18 (1994), 461-468) proved that D is pan cyclic. In this note, we give a short proof, based on Song's result, that D is, in fact, vertex pancyclic. This also generalizes a result of Jackson ( J. Graph Theory 5 (1981), 147-157) for the existence of a hamiltonian cycle in oriented graphs, (C) 1999 John Wiley & Sons, Inc.