A. Work through mindscapes 18, 19, 20, 21 on page 398, which lead you through exploration of this concept.
B. Explain why the 7 bridges of Königsberg do not admit an Euler path. (This was in fact Euler's original problem, back in 1743).
C. Mindscape 33. This involves making up a story, and will be graded S/U. It must relate somehow to Euler circuits or Euler paths, and must be in your own words.
A graph is connected if any two vertices can be joined by a chain of edges (see page 403).
D. Work mindscapes 26, 27, 28 on page 411, which explore what happens if
the Euler characteristic is computed for a graph which is not