K-Cyclable graph

[math]\displaystyle{ k }[/math]-Cyclable graph --- [math]\displaystyle{ k }[/math]-цикловой граф.

The graph [math]\displaystyle{ g }[/math] is [math]\displaystyle{ k }[/math]-cyclable if any [math]\displaystyle{ k }[/math] vertices of [math]\displaystyle{ G }[/math] lie on a common cycle. It is easy to see that every [math]\displaystyle{ k }[/math]-connected graph is [math]\displaystyle{ k }[/math]-cyclable.