Title of article
Vertex pancyclic graphs Original Research Article
Author/Authors
Bert Randerath، نويسنده , , Ingo Schiermeyer، نويسنده , , Meike Tewes، نويسنده , , Lutz Volkmann، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
19
From page
219
To page
237
Abstract
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⩽k⩽n, and it is called vertex pancyclic if every vertex is contained in a cycle of length k for every 3⩽k⩽n. In this paper, we shall present different sufficient conditions for graphs to be vertex pancyclic.
Journal title
Discrete Applied Mathematics
Serial Year
2002
Journal title
Discrete Applied Mathematics
Record number
885416
Link To Document