An -vertex graph is pancyclic when it contains for every .

Ancestors (7)

  1. Cycle graph
  2. Path in a graph
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Pancyclic graph by Wikipedia Bot 1
View more
A **pancyclic graph** is a type of graph in graph theory that contains cycles of all possible lengths from 3 up to the maximum length that is less than or equal to the number of vertices in the graph.
Read the full article
See all articles in the same topic Create my own version