Introductory graph theory with applications. Graphs, digraphs. Eulerian and Hamiltonian graphs. The travelling salesman. Path algorithms; connectivity; trees; planarity; colourings; scheduling; minimal cost networks. Tree searches and sortings, minimal connectors and applications from physical and biological sciences. Prerequisite: At least six credits from 2000-level mathematics courses without second digit 5.