Hamiltonian graph

Hamiltonian graph --- гамильтонов граф.

This is a graph which has a Hamiltonian circuit. A Hamiltonian graph [math]\displaystyle{ G }[/math] of order [math]\displaystyle{ n }[/math] is [math]\displaystyle{ k }[/math]-ordered, [math]\displaystyle{ 2 \leq k \leq n }[/math], if for every sequence [math]\displaystyle{ v_{1}, \ldots, v_{k} }[/math] of [math]\displaystyle{ }[/math] distinct vertices of [math]\displaystyle{ G }[/math], there exists a Hamiltonian circuit that encounters [math]\displaystyle{ v_{1}, \ldots, v_{k} }[/math] in this order.