We will mainly use Reinhard Diestel's book Graph Theory, see http://diestel-graph-theory.com/
The proof of the weak perfect graph theorem (Theorem 5.5.4) that we sketched in class is not included in Diestel's book. Details can be found in Matt DeVos's notes http://www.sfu.ca/~mdevos/notes/misc/perf_graph.pdf
For the last two lectures (about Tutte polynomials), we will use Matthias Beck's and Raman Sanyal's book Combinatorial Reciprocity Theorems, see http://math.sfsu.edu/beck/papers/crt.pdf
For the essay task in worksheet 2, read Paul Seymour's paper How the proof of the strong perfect graph conjecture was found: https://web.math.princeton.edu/~pds/papers/howtheperfect/howtheperfect.pdf
The lectures and exercise sessions will be given via the meeting platform Zoom. Please familiarize yourelf with Zoom on this link before the first meeting, if you haven't done so already.