K-Walk
Материал из WEGA
[math]\displaystyle{ k }[/math]-Walk --- [math]\displaystyle{ k }[/math]-маршрут.
A [math]\displaystyle{ k }[/math]-walk in a graph is a spanning closed walk using each vertex at most [math]\displaystyle{ k }[/math] times. When [math]\displaystyle{ k = 1 }[/math], a 1-walk is a Hamilton cycle.
