∆ Определение 5.

A Hamiltonian graph is a graph with a path that contains each vertex exactly once.