Work Step by Step
A connected graph has at least one Euler path, but no Euler circuit, if the graph has exactly two odd vertices.
You can help us out by revising, improving and updating this answer.Update this answer
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.