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.
This is a
first course in graph theory. After an introduction to graphs, we
consider trees, circuits, cycles and connectedness. We may also
consider extremal problems, and
counting and labelings of graphs.
The text and grading scheme have not yet been determined.
Prerequisite:At least six credits from 2000level (or higher) MATH courses
(without second digit 5), or permission of the instructor.
Coordinator: Richard Ganong.
