This course will explore the following topics: Graphs, subgraphs, isomorphism, trees, connectivity, Euler and Hamiltonian properties, matchings, vertex and edge colourings, planarity, network flows and strongly regular graphs. Participants will be encouraged to use these topics and execute applications to such problems as timetabling, tournament scheduling, experimental design and finite geometries.