A Sufficient Condition for Pancyclic Graphs

In this paper we prove that, except for the 4-cycle and the 5-cycle, every 2-connected \(K(1,3)\)-free graph of diameter at most two is pancyclic.