Mth 561 Graph Theory I

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 first course in a sequence of two: Mth 561 and Mth 562 which must be taken in sequence. Also offered for undergraduate-level credit as Mth 461 and may be taken only once for credit.