The longest cycles in a graph G with minimum degree at least \(| G| /k\)
This article shows that if \(d_ G(x)+d_ G(y)\geq \lceil 2| V(G)| /k\rceil\) for any nonadjacent distinct vertices x and y of V(G), then G has a cycle of length at least \(\lceil | V(G)| /(k- 1)\rceil\).
scientific article; zbMATH DE number 4095503