Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.2 Euler Paths and Euler Circuits - Concept and Vocabulary Check - Page 909: 9


The original statement is false.

Work Step by Step

A path that travels through every edge of a graph exactly once is called an Euler path. If an Euler path starts and ends at the same vertex, then it is an Euler circuit. However, if an Euler path starts at one vertex and ends at a different vertex, then it is not an Euler circuit. So an Euler path is not necessarily an Euler circuit. Therefore, not every Euler path is an Euler circuit.
Update this answer!

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.