Note: If this course is being taught this semester, more information can be found at the course home page.
This course is a prerequisite or co-requisite for
Paths, circuits, tress. Bipartite graphs, matching problems. Unicursal graphs, Hamiltonian circuits, factors. Independent paths and sets. Matrix representations. Planar graphs. Coloring problems.