Instructor
H. Smith

A rigorous introduction to graph theory including the study of trees, connectivity, graph distances, adjacency matrices, Euler tours, Hamiltonian cycles, matchings, graph colorings, planarity, Euler characteristic, directed graphs, network flows, algorithms and extremal problems.

Counts as an elective in the Theory category of the Computer Science major.
Satisfies the Mathematical and Quantitative Thought requirement.

Prerequisites
One of the following: MAT/CSC 220, MAT 230, MAT 255

Class Details
Course MAT 325
Section 0
CRN 20315
Time T R
Time 1135 - 1250pm
Building 3068 CHAM
Instructor Carl Yerger
Notes
Max 30
Current 0
Remaining 30
Semester Spring 2022