Modules / Lectures
NameDownloadDownload Size
Lecture NoteDownload as zip file1.7M
Module NameDownloadDescriptionDownload Size
Covering problemsLecture1Handouts190
Covering problemsLecture2Handouts214
Covering problemsLecture3Handouts166
Covering problemsLecture4Handouts234
Covering problemsLecture5Handouts278
Covering problemsLecture6Handouts227
Covering problemsLecture7Handouts262
Covering problemsLecture8Handouts258
Special classes of graphsLecture23Handouts187
Special classes of graphsLecture24Handouts197
Special classes of graphsLecture25Handouts172
Special classes of graphsLecture26Handouts200
Special classes of graphsLecture27Handouts248
Special classes of graphsLecture28Handouts233
Special classes of graphsLecture29Handouts214
Special classes of graphsLecture30Handouts175
Network flowsLecture31Handouts191
Network flowsLecture32Handouts167
Network flowsLecture33Handouts141
Network flowsLecture34Handouts151
Random graphs and probabilistic methodLecture35Handouts145
Random graphs and probabilistic methodLecture36Handouts148
Random graphs and probabilistic methodLecture37Handouts118
Random graphs and probabilistic methodLecture38Handouts122
Graph minorsLecture39Handouts208
Graph minorsLecture40Handouts166

Sl.No Chapter Name English
1Introduction: Vertex cover and independent setPDF unavailable
2Matchings: Konigs theorem and Halls theoremPDF unavailable
3More on Halls theorem and some applicationsPDF unavailable
4Tuttes theorem on existence of a perfect matchingPDF unavailable
5More on Tuttes theoremPDF unavailable
6More on MatchingsPDF unavailable
7Dominating set, path coverPDF unavailable
8Gallai : Millgram theorem, Dilworths theoremPDF unavailable
9Connectivity: 2-connected and 3- connected graphsPDF unavailable
10Mengers theoremPDF unavailable
11More on connectivity: k- linkednessPDF unavailable
12Minors, topological minors and more on k- linkednessPDF unavailable
13Vertex coloring: Brooks theoremPDF unavailable
14More on vertex coloringPDF unavailable
15Edge coloring: Vizings theoremPDF unavailable
16Proof of Vizings theorem, Introduction to planarityPDF unavailable
175- coloring planar graphs, Kuratowskys theoremPDF unavailable
18Proof of Kuratowskys theorem, List coloringPDF unavailable
19List chromatic indexPDF unavailable
20Adjacency polynomial of a graph and combinatorial NullstellensatzPDF unavailable
21Chromatic polynomial, k - critical graphsPDF unavailable
22Gallai-Roy theorem, Acyclic coloring, Hadwigers conjecturePDF unavailable
23Perfect graphs: ExamplesPDF unavailable
24Interval graphs, chordal graphsPDF unavailable
25Proof of weak perfect graph theorem (WPGT)PDF unavailable
26Second proof of WPGT, Some non-perfect graph classesPDF unavailable
27More special classes of graphsPDF unavailable
28Boxicity,Sphericity, Hamiltonian circuitsPDF unavailable
29More on Hamiltonicity: Chvatals theoremPDF unavailable
30Chvatals theorem, toughness, Hamiltonicity and 4-color conjecturePDF unavailable
31Network flows: Max flow mincut theoremPDF unavailable
32More on network flows: CirculationsPDF unavailable
33Circulations and tensionsPDF unavailable
34More on circulations and tensions, flow number and Tuttes flow conjecturesPDF unavailable
35Random graphs and probabilistic method: PreliminariesPDF unavailable
36Probabilistic method: Markovs inequality, Ramsey numberPDF unavailable
37Probabilistic method: Graphs of high girth and high chromatic numberPDF unavailable
38Probabilistic method: Second moment method, Lovasz local lemmaPDF unavailable
39Graph minors and Hadwigers conjecturePDF unavailable
40More on graph minors, tree decompositionsPDF unavailable

Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available