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 - Exercise Set 14.2 - Page 913: 72


The original statement does not make sense.

Work Step by Step

The original statement does not make sense. An Euler path is a path in a graph that travels through every edge of the graph exactly once. Let's suppose a UPS driver modeled the delivery locations as vertices and the roads between the locations as edges. To deliver packages efficiently, the driver should try to minimize the time spent driving on the roads. However, if the driver followed an Euler path, then the driver would end up driving along every road between the locations. This would not be an efficient way to deliver packages. Since an Euler path includes every edge on a graph, it would be a bad idea for a UPS driver to follow an Euler path.
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.