 Pancyclic graph

An $n$-vertex graph is pancyclic when it contains $C_{\ell }$ for every $3\le \ell \le n$.

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.