an:06775841
Zbl 1370.05109
Cream, Megan; Gould, Ronald J.; Larsen, Victor
Forbidden subgraphs for chorded pancyclicity
EN
Discrete Math. 340, No. 12, 2878-2888 (2017).
00369921
2017
j
05C38
pancyclic; chorded cycle; forbidden subgraph; Hamiltonian
Summary: We call a graph \(G\) pancyclic if it contains at least one cycle of every possible length \(m\), for \(3 \leq m \leq | V(G) |\). In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length \(4, 5, \ldots, | V(G) |\). In particular, certain paths and triangles with pendant paths are forbidden.