Directed and undirected graphs; paths, cycles, trees, Eulerian cycles, matchings and coverings, connectivity, Menger's Theorem, network flow, coloring, planarity, with applications to the sciences (computer, life, physical, social) and engineering.
[(MATH 230 with min. grade of D and MATH 251 with min. grade of D) OR (MATH 230 with min. grade of D and MATH 252 with min. grade of D)]