MATH5707: Graph Theory and Non-enumerative Combinatorics
4 Credits
Basic topics in graph theory: connectedness, Eulerian/Hamiltonian properties, trees, colorings, planar graphs, matchings, flows in networks. Optional topics include graph algorithms, Latin squares, block designs, Ramsey theory.
prereq: [2243 or 2373 or 2573], [2263 or 2374 or 2574]; [2283 or 3283 or experience in writing proofs] highly recommended.
Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2025 provided by the University in response to a public records request