Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Introduces discrete structures and applications of graph theory to computer science, engineering, operations research, social science, and biology. Topics include connectivity, coloring, trees, Euler and Hamiltonian paths and circuits, matching and covering problems, shortest route and network flows. Note: This course is not applicable toward any degree in the College of Liberal Arts and Sciences. Note: this course assumes that students have completed MATH 3000 or equivalent. Cross-listed with MATH 4408.
Units: 3.0
Hours: 3 to 3