Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-free graphs (Q1733851)

It is shown that every 4-connected claw-free \(Z_8\)-free graph is either pancyclic or is the line graph of the Petersen graph, where \(Z_i\) denotes the graph obtained by identifying an endpoint of the path \(P_{i+1}\) with a vertex of a triangle. Furthermore, as a consequence, it follows that every 4-connected claw-free \(Z_6\)-free graph and every 5-connected claw-free \(Z_8\)-free graph are pancyclic.