Thinking Mathematically (6th Edition)

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

Chapter 14 - Graph Theory - 14.3 Hamilton Paths and Hamilton Circuits - Exercise Set 14.3: 48

Answer

A Hamilton path is a path that passes through every vertex in the graph exactly once. An Euler path is a path that passes through every edge in the graph exactly once.

Work Step by Step

A Hamilton path is a path that passes through every vertex in the graph exactly once. An Euler path is a path that passes through every edge in the graph exactly once. Note that a Hamilton path refers to vertices in a graph while an Euler path refers to edges in a graph.
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.