Solved: This exercise refers to the Fourth of July parade problem introduced in Exercise
Chapter 5, Problem 55(choose chapter or problem)
This exercise refers to the Fourth of July parade problem introduced in Exercise 27. Find an optimal route for the parade that starts at A and ends at B (see Fig. 40). Describe the route by labeling the edges 1, 2, 3, . . . etc. in the order they are traveled. [Hint: Start with the graph model for the parade route (see Exercise 27); then find an optimal semi-eulerization of the graph that leaves A and B odd; then find an Euler path in this new graph.]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer