Question
1.42
12.
Jack and Jill are located in Miami and want to fly to Berlin (see
Figure 1.2
).
Find three paths for them to carry out this trip.
What is the largest number of paths that can be used to carry out this trip that do not repeat a
vertex
(city)?
Explain why it is reasonable not to want to repeat a vertex in this situation.