MATH7233 (Graph Theory) course reviews and ratings at Northeastern (NEU). Compare professors with RateMyProfessor reviews.
Covers fundamental concepts in graph theory. Topics include adjacency and incidence matrices, paths and connectedness, and vertex degrees and counting; trees and distance including properties of trees, distance in graphs, spanning trees, minimum spanning trees, and shortest paths; matchings and factors including matchings in bipartite graphs, Hall’s matching condition, and min-max theorems; connectivity, such as vertex connectivity, edge connectivity, k-connected graphs, and Menger’s theorem; network flows including maximum network flow, and integral flows; vertex colorings, such as upper bounds, Brooks, theorem, graphs with large chromatic number, and critical graphs; Eulerian circuits and Hamiltonian cycles including Euler’s theorem, necessary conditions for Hamiltonian cycles, and sufficient conditions; planar graphs including embeddings and Euler’s formula, characterization of planar graphs (Kuratowski’s theorem); and Ramsey theory including Ramsey’s theorem, Ramsey numbers, and graph Ramsey theory.
Data updated October 2026.