Pancyclicity in claw-free graphs (Q1849921): Difference between revisions

A graph \(G\) is subpancyclic if it contains cycles of every length \(m\) with \(3\leq m\leq c(G)\), where \(c(G)\) denotes the circumference of \(G\). The authors present several conditions for claw-free graphs, which guarantee the graphs are subpancyclic. In particular, they show that every \(K_{1,3}\)-free graph of order \(n\geq 5\) with minimum degree sum \(\delta_2>2\sqrt{3n+1}-4\); every \(\{K_{1,3},P_7\}\)-free graph with \(\delta_2\geq 9\); and every \(K_{1,3}\)-free graph of order \(n\geq 5\) with minimum degree \(\delta>\sqrt{3n+1}-4\) is subpancyclic. Examples demonstrate the sharpness of these results.