Chapter 13.2, Problem 32E

Locking Doors Recall Joe from Example 5 on page 816 who runs a gym-cleaning service. Joe is also responsible for locking the doors of four other gyms. The floor plans for these gyms are shown in Exercises 29-32.

1. a. Represent each floor plan as a graph. Use the letters shown to label the vertices of the graph and use the letter O to label the vertex that represents the outside of the gym. Place vertex O near where the word Outside is placed m the diagram.
2. b. Determine (state yes or no) whether it is possible for Joe to move through the gym using each doorway of the gym exactly one time. In other words, does an Euler path exist in the graph?
3. c. If your answer to part (b) is yes, determine one such Euler path.

32. NY Fitness