# Chapter 14 - Graph Theory - 14.2 Euler Paths and Euler Circuits - Exercise Set 14.2 - Page 913: 67

One of the two odd vertices should be chosen as the starting point for an Euler path.

#### Work Step by Step

If a graph has an Euler path but no Euler circuit, then the graph must have exactly two odd vertices. Any Euler path in this graph starts at one odd vertex and ends at the other odd vertex. Therefore, one of the two odd vertices should be chosen as the starting point for an Euler path in this graph.

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.