Connectivity and Menger’s theorem; embeddings of graphs and Kuratowski’s theorem; network flows; crossing number; structure of k-chromatic graphs; Hamiltonian cycles; decomposition and packing of graphs.