| 1 | Introduction: Vertex cover and independent set | PDF unavailable |
| 2 | Matchings: Konigs theorem and Halls theorem | PDF unavailable |
| 3 | More on Halls theorem and some applications | PDF unavailable |
| 4 | Tuttes theorem on existence of a perfect matching | PDF unavailable |
| 5 | More on Tuttes theorem | PDF unavailable |
| 6 | More on Matchings | PDF unavailable |
| 7 | Dominating set, path cover | PDF unavailable |
| 8 | Gallai : Millgram theorem, Dilworths theorem | PDF unavailable |
| 9 | Connectivity: 2-connected and 3- connected graphs | PDF unavailable |
| 10 | Mengers theorem | PDF unavailable |
| 11 | More on connectivity: k- linkedness | PDF unavailable |
| 12 | Minors, topological minors and more on k- linkedness | PDF unavailable |
| 13 | Vertex coloring: Brooks theorem | PDF unavailable |
| 14 | More on vertex coloring | PDF unavailable |
| 15 | Edge coloring: Vizings theorem | PDF unavailable |
| 16 | Proof of Vizings theorem, Introduction to planarity | PDF unavailable |
| 17 | 5- coloring planar graphs, Kuratowskys theorem | PDF unavailable |
| 18 | Proof of Kuratowskys theorem, List coloring | PDF unavailable |
| 19 | List chromatic index | PDF unavailable |
| 20 | Adjacency polynomial of a graph and combinatorial Nullstellensatz | PDF unavailable |
| 21 | Chromatic polynomial, k - critical graphs | PDF unavailable |
| 22 | Gallai-Roy theorem, Acyclic coloring, Hadwigers conjecture | PDF unavailable |
| 23 | Perfect graphs: Examples | PDF unavailable |
| 24 | Interval graphs, chordal graphs | PDF unavailable |
| 25 | Proof of weak perfect graph theorem (WPGT) | PDF unavailable |
| 26 | Second proof of WPGT, Some non-perfect graph classes | PDF unavailable |
| 27 | More special classes of graphs | PDF unavailable |
| 28 | Boxicity,Sphericity, Hamiltonian circuits | PDF unavailable |
| 29 | More on Hamiltonicity: Chvatals theorem | PDF unavailable |
| 30 | Chvatals theorem, toughness, Hamiltonicity and 4-color conjecture | PDF unavailable |
| 31 | Network flows: Max flow mincut theorem | PDF unavailable |
| 32 | More on network flows: Circulations | PDF unavailable |
| 33 | Circulations and tensions | PDF unavailable |
| 34 | More on circulations and tensions, flow number and Tuttes flow conjectures | PDF unavailable |
| 35 | Random graphs and probabilistic method: Preliminaries | PDF unavailable |
| 36 | Probabilistic method: Markovs inequality, Ramsey number | PDF unavailable |
| 37 | Probabilistic method: Graphs of high girth and high chromatic number | PDF unavailable |
| 38 | Probabilistic method: Second moment method, Lovasz local lemma | PDF unavailable |
| 39 | Graph minors and Hadwigers conjecture | PDF unavailable |
| 40 | More on graph minors, tree decompositions | PDF unavailable |