A graph has an Euler path if and only if all vertices but precicely two have even degree.
I found this on an old thread.
So a possible answer to this question could simply be a circle that is connected by 8 vertices. Correct? Since there is no 2 vertices in the graph that DONT have even degree.