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

A graph is called Euler graph is it contains a cycle that passes each edge exactly once.