MATH 3150
Introduction to Graph Theory
This course will cover paths and cycles, bipartite graphs, graph isomorphisms, connectivity, Eulerian graphs, Hamiltonian graphs, trees, properties of trees, planarity, Euler’s formula, dual graphs, coloring graphs, Brooks’ theorem, coloring maps, chromatic polynomials, digraphs, matchings, Menger’s theorem, Hall’s theorem, and Tutte’s theorem. (Prerequisites: MATH-2250 or COMP-2310.) (3 lecture hours per week.)
Sources
- Course catalogue ↗Winter 2027