Course Description

Mathematics 223b Discrete Structures II

This course continues the development of logical reasoning and proofs begun in Mathematics 222a. Topics include elementary number theory (gcd, lcm, Euclidean algorithm, congruences, Chinese remainder theorem) and graph theory (connectedness, complete, regular and bipartite graphs; trees and spanning trees, Eulerian and Hamiltonian graphs, planar graphs; vertex, face and edge colouring; chromatic polynomials).

Prerequisite: Mathematics 222a.
4 lecture hours, half course.


Academic Calendar
[Table of Contents] [Index]
[Courses by Subject] [Courses by Name] [Awards by Category] [Awards by Name] [Calendar Search]