Vertex pancyclic graphs

  • Authors:

  • Bert Randerath;Ingo Schiermeyer;Meike Tewes;Lutz Volkmann

  • Affiliations:

  • Institut für Informatik, Universität zu Köln, Pohligstrasse 1 50969 Köln, Germany;Fakultät für Mathematik und Informatik, TU Bergakademie Freiberg, 09596 Freiberg, Germany;Fakultät für Mathematik und Informatik, TU Bergakademie Freiberg, 09596 Freiberg, Germany;Lehrstuhl II für Mathematik, RWTH Aachen, 52056 Aachen, Germany

  • Venue:
  • Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.