Institutional Learning Outcomes: Knowledge An introductory course deals mostly with non-algorithmic topics, including connectivity, Eulerian graphs, Hamiltonian graphs, planarity and Kuratowski's Theorem, matchings, graph colouring, and extremal graphs. Applications of graphs are discussed. Prerequisites: MATH 2700-Discrete Mathematics 2 with a minimum grade of C or A minimum grade of C in at least 12 credits of Mathematics or Statistics courses numbered 2000 or higher.
Institutional Learning Outcomes: Knowledge An introductory course deals mostly with non-algorithmic topics, including connectivity, Eulerian graphs, Hamiltonian graphs, planarity and Kuratowski's Theorem, matchings, graph colouring, and extremal graphs. Applications of graphs are discussed. Prerequisites: MATH 2700-Discrete Mathematics 2 with a minimum grade of C or A minimum grade of C in at least 12 credits of Mathematics or Statistics courses numbered 2000 or higher.
