A sufficient condition guaranteeing large cycles in graphs
\textit{P. Bedrossian, G. Chen} and \textit{R. H. Schelp} [Discrete Math. 115, No. 1-3, 39-50 (1993; Zbl 0773.05075)] gave a degree condition sufficient for the existence of long cycles in a graph \(G\). This paper improves their result by giving the condition in terms of \(\omega (G)\), an invariant described by examining neighbors of nonadjacent vertices that are part of an induced claw or modified claw.
scientific article; zbMATH DE number 1021697