E D F G I H Consider the graph given above. Give an Euler trail through the graph by listing the vertices in the order visited.

Upper is #1, the lower is #2.

Extracted text: E D F G I H Consider the graph given above. Give an Euler trail through the graph by listing the vertices in the order visited.


Extracted text: Consider the graph given above. Give an Euler circuit through the graph by listing the vertices in the order visited.