Weakly pancyclic graph

Weakly pancyclic graph --- слабо панциклический граф.

A graph [math]\displaystyle{ G }[/math] with [math]\displaystyle{ n }[/math] vertices is mathcalled a weakly pancyclic graph, if it has cycles of all lengths from the girth to the circumference.