Is it possible to find an Euler circuit for the Big 10 football conference described in Problem 11? That is, is it possible to start the trip in any given state and end the trip in the state in which you started?

Data from problem 11

The Big 10 football conference consists of the following 14 schools:
Ohio State, Penn State, Michigan, Michigan State, Wisconsin, Iowa, Illinois, Northwestern (Ill.), Indiana, Purdue (Indiana), Minnesota, Maryland, Nebraska, and Rutgers (New Jersey)

Is it possible to visit each of these schools by crossing each common state border exactly once? If so, find an Euler path.

Transcribed Image Text:

Nebraska Minn. Iowa Wisc. Mich., III. Ind. Ohio New Jersey Penn. Maryland