MA238 Discrete Mathematics 0.5 |
Basic graph theory, Euler circuits and Hamilton cycles in graphs, planar graphs, graph colouring, trees, relations, partial orders, introduction to counting, recurrence relations, inclusion-exclusion. |
Prerequisite: MA121 and an additional 0.5 MA credit. |
Official electronic version updated at 10:33 a.m. March 31, 2005