Graphs, subgraphs, isomorphism, trees, connectivity, Euler and Hamiltonian properties, matchings, vertex and edge colourings, planarity, network flows and strongly regular graphs; applications to such problems as timetabling, personnel assignment, tank form scheduling, traveling salesmen, tournament scheduling, experimental design and finite geometries.