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


Fleury's, bridge

Work Step by Step

Euler's Theorem enables us to count a graph's odd vertices and determine if it has an Euler path or an Euler circuit. A procedure for finding such paths is called Fleury's Algorithm. When using this algorithm and faced with a choice of edges to trace, choose an edge that is not a bridge. Travel over such an edge only if there is no alternative.
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.