Arrangements, selections and counting methods, generating functions, recurrence relations, the principle of inclusion and exclusion. Introduction to graph theory, trees and searching, Eulerian and Hamiltonian Circuits, planar graphs and coloring of graphs, applications to optimization problems such as network flows.