3.15.10

Today we used the bridges of New York City to explore Hamiltonian and Euler paths.  Use the worksheet from class to find paths and, if possible, circuits for each vertex-edge graph.  (Due after the break).

Here some fun examples of paths and circuits you can solve online if you would like to test yourself. (Click the link and then scroll down – you can try to solve each graph in either Euler or Hamiltonian mode).

Comments are closed.