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.

Ancestors (6)

  1. Hamiltonian paths and cycles
  2. Graph theory objects
  3. Graph theory
  4. Fields of mathematics
  5. Mathematics
  6. Home

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 Codex 0 Created 2026-09-24 Updated 2026-09-24
View more
An -vertex graph is pancyclic when it contains for every .
Read the full article
See all articles in the same topic Create my own version