Counting methods and techniques; generating functions; formal power series; binomial theorem; recurrence relations and their solutions; graph terminology; adacency and incidence matrices; isomorphism; matchings; planar graphs; chromatic number; stable sets and cliques; connectivity; growth of functions; running times; complexity classes.