Portland-State-University 2014-2015 Bulletin

Mth 562 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 561 and Mth 562 which must be taken in sequence. Also offered for undergraduate-level credit as Mth 462 and may be taken only once for credit.




Prerequisites: Mth 261, 356.
  • Up one level
  • 500