University of South Alabama
Fundamental concepts, connectedness, graph coloring, planarity and Kuratowski's theorem, four-color theorem, chromatic polynomial, Eulerian and Hamiltonian graphs, matching theory, network flows, NP-complete graph problems, Markov chains, matroids.
3 credits
MA 525
Prerequisites, corequisites, and courses that build on this one
Complete these courses before enrolling
