In this Konigsberg Bridge problem worksheet, students solve 35 short answer problems. Students construct networks consisting of even and odd vertices. Students make conjectures about the number of odd and even vertices on a vertex-edge...

In this networks activity, students solve 10 problems in which they calculate the shortest driving route between two cities. This page is intended to be an online activity, but can be completed on paper.

This lesson focuses on developing a way to cross all 7 Bridges of Konigsberg without crossing any of them more than once. Euler discovered it was impossible, but he developed the idea of using graph theory to determine if it would be...

This site contains a Wikipedia description of computer networks.