# Chapter 14 - Graph Theory - 14.2 Euler Paths and Euler Circuits - Exercise Set 14.2: 6

Neither. The path is not an Euler path or an Euler circuit.

#### Work Step by Step

An Euler path is a path that travels through every edge of a graph exactly once. An Euler circuit is an Euler path that begins and ends at the same vertex. This path travels through 8 edges from vertex A to vertex D. However, the graph has 9 edges. Therefore the path does not travel through every edge of the graph. Therefore, this path can not be an Euler path. Since the path is not an Euler path, the path can not be an Euler circuit. We can see that the path does not travel through the edge connecting vertex D and vertex A. Therefore the path is not an Euler path.

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.