K-covering cycle

Weak [math]\displaystyle{ k }[/math]-covering cycle --- слабо [math]\displaystyle{ k }[/math]-покрывающий цикл.

A weak [math]\displaystyle{ k }[/math]-covering cycle [math]\displaystyle{ C }[/math] of a graph [math]\displaystyle{ G }[/math] is a cycle [math]\displaystyle{ C }[/math] such that each component of [math]\displaystyle{ G - V(C) }[/math] has fewer than [math]\displaystyle{ k }[/math] vertices.

The other name is [math]\displaystyle{ k }[/math]-dominating cycle.