Combinatorics and Graph Theory.

Catalog description

This course provides a rigorous study in the topics of combinatorics and graph theory. Topics include principles of counting, graphs, digraphs, Eulerian and Hamiltonian graphs, connectivity, path algorithms, trees, planarity, coloring of graphs, tree searches and sortings, binomial coefficients, generating functions, recurrence relations, and networks flows, and associated algorithms. Appropriate computer software and hand-held technologies will be utilized. Prerequisite: MATH 330 or MATH 2305 with grade of C or better.