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: 61

Answer

An Euler path is a path that travels through every edge in the graph exactly once.

Work Step by Step

A path is a sequence of vertices in a graph. A path travels through the edges which connect the vertices. An Euler path is a path that travels through every edge in the graph exactly once.
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.