Graph Theory

Undergraduate

Isomorphism, classes of graphs, vertex degrees, graphic sequences, properties of trees, spanning trees, decompositions, Eulerian graphs, Hamiltonian graphs, matchings and factorizations including Hall’s Theorem, connectivity, graph colouring, planar graphs including Euler’s Formula, extremality, optimization. Prerequisite(s): MATH 2313 and a MATH 3000- or 4000-level course either taken previously or concurrently, with minimum grades of C-.