Answer
two
Work Step by Step
A connected graph has at least one Euler path, but no Euler circuit, if the graph has exactly two odd vertices.
Thinking Mathematically (6th Edition)
by Blitzer, Robert F.
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: 3
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answerAfter 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.
