In this Unit, you will use vertex-edge graphs and Euler Circuits to help find optimum paths. Included are two lessons that help you develop the understanding and skill needed to solve problems about optimum paths and conflicts.

A description of vertex connectivity, that relates to edge connectivity.

A description of edge connectivity, that relates to vertex connectivity.

You will find a definition and diagrams dealing with vertex coloring.

This site displays a description and diagrams dealing with edge coloring.

A very brief description of graph coloring.

Based off of the hit television show NUMB3RS, this lesson use graph theory to examine social network analysis. Students form complete graphs with different colored edges (representing acquaintance or non-acquaintance), and determine how...