A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Let G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length k for every 3 6 k 6 n, and it is called vertex pancyclic if every vertex is contained in a cycle of length k for every 3 6 k 6 n. In this paper, we shall present di erent su cient conditions for graphs to be vertex pancyclic. ?doi:10.1016/s0166-218x(01)00292-x fatcat:fesqsyyg6ff7no23v34htxbi7y