Mth 462 Graph Theory II
Topics in graph theory, including connectivity, matchings, graph algorithms, network flows, graph matrices, isomorphisms, Eulerian and Hamiltonian graphs, spanning trees, decompositions, shortest paths, the matrix-tree theorem, colorings of graphs, planarity and embeddings, Kuratowski's theorem, matroids, and selected applications. This is the second course in a sequence of two: Mth 461 and Mth 462 which must be taken in sequence. Also offered for graduate-level credit as Mth 562 and may be taken only once for credit.
Prerequisite
Prerequisites:
Mth 261, 356.