Week 1 : Basic Concepts: Graphs and digraphs, Incidence and adjacency matrices, isomorphism, the automorphism group.
Week 2 : Connectivity: Cut vertices, cut edges, bonds, the cycle space and the bond space, blocks, Menger s theorem; Paths and Cycles: Euler tours, Hamilton paths and cycles, theorems of Dirac, Ore, Bondy and Chvatal, girth, circumference, the Chinese Postman Problem, The Travelling Salesman problem, diameter and maximum degree, shortest paths.
Week 3 : Trees: Equivalent definitions of trees and forests, Cayleys formula, the Matrix-Tree theorem, minimum spanning trees;
Week 4 : Matchings: Berges Theorem, perfect matchings, Halls theorem, Tuttes theorem, Konigs theorem, Petersens theorem, Algorithms for matching and weighted matching (in both bipartitie and general graphs), factors of graphs (decompositions of the complete graph), Tuttes f-factor theorem;
Week 5 : Extremal problems: Independent sets and covering numbers, Turans theorem, Ramsey theorems;
Colorings: Brooks theorem, the greedy algorithm, the Welsh-Powell bound, critical graphs, chromatic polynomials, girth and chromatic number
Week 6 : Vizings theorem; Graphs on surfaces: Planar graphs, duality, Eulers formula, Kuratowskis theorem, toroidal graphs, 2-cell embeddings, graph on other surfaces;
Week 7 : Directed graphs: Tournaments, directed paths and cycles, Connectivity and strongly connected digraphs, branchings;
Networks and flows: Flow cuts, Max flow min cut theorems, perfect square;
Week 8 : Selected topics: Dominating sets, The reconstruction problem, Intersection graphs, Perfect graphs, Random graphs.