Graph theory and algorithms

By the end you’ll be able to

• Use graph terminology (degree, path, cycle, connected, tree, bipartite, complete) and apply the handshake lemma
• Apply properties of trees (a tree on n vertices has n − 1 edges) and Euler’s formula V − E + F = 2 for connected planar graphs
• Decide whether graphs have Euler circuits or paths and recognise simple Hamiltonian and colouring arguments