Portland-State-University 2016-2017 Bulletin

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.

Credits

3

Prerequisite

Mth 461.
  • Up one level
  • 400