Answer Happy

Shown in the figure are the map and the graph that models the bordering relationships among the six states. Use Euler's Theorem to explain why it is possible to find a path that crosses each common state border exactly once. A D F С X E E B Choose the correct answers below. A path that crosses each border once is an The graph has vertices. Therefore, according to Euler's Theorem, at least one such path must exist. no even no odd exactly two even exactly two odd more than two even more than two odd