Top Posters
Since Sunday
k
3
r
3
j
3
V
3
l
3
J
2
1
2
n
2
O
2
h
2
d
2
s
2
New Topic  
seeb1999 seeb1999
wrote...
Posts: 480
Rep: 2 0
4 years ago
Answer the question.

The map below shows states in the upper  midwest of the United States.  Use Euler's theorem to determine whether a family could visit each state shown while crossing each common border only once.  If such a path or circuit exists, use trial and error or Fleury's algorithm to find one.



▸ Euler path;  MI, IN, IL, MO, IA, MN, WI, IA, IL, WI

▸ not possible

▸ Euler circuit; IN, IL, MO, IA, MN, WI, IA, IL, WI, MI, IN
Textbook 
Thinking Mathematically

Thinking Mathematically


Edition: 6th
Author:
Read 1473 times
14 Replies
Replies
Answer verified by a subject expert
antheadanthead
wrote...
Posts: 408
4 years ago
Sign in or Sign up in seconds to unlock everything for free
More solutions for this book are available here

Related Topics

wrote...
4 years ago
Thanks
wrote...
3 years ago
.
wrote...
3 years ago
thank you
wrote...
3 years ago
Thanks
wrote...
3 years ago
Thank you
wrote...
3 years ago
thanks
wrote...
3 years ago
thank you!
wrote...
3 years ago
Thanks!
wrote...
3 years ago
Thank you!
wrote...
3 years ago
thank you
wrote...
3 years ago
thank you
wrote...
3 years ago
Thanks
  New Topic      
Explore
Post your homework questions and get free online help from our incredible volunteers
  937 People Browsing
 110 Signed Up Today
Related Images
  
 185
  
 831
  
 210
Your Opinion
What's your favorite math subject?
Votes: 315