Module NameDownloadDescriptionDownload Size
Week 01Lecture 01Graph Theory: Introduction1181 kb
Week 01Lecture 02Paths, Cycles, and Trails1176 kb
Week 01Lecture 03Eulerian Circuits, Vertex Degrees and Counting1080 kb
Week 02Lecture 04The Chinese Postman Problem and Graphic Sequences1267 kb
Week 02Lecture 05Trees and Distance1057 kb
Week 02Lecture 06Spanning Trees and Enumeration1056 kb
Week 03Lecture 07Matchings and Covers1141 kb
Week 03Lecture 08Independent Sets, Covers and Maximum Bipartite Matching1712 kb
Week 03Lecture 09Weighted Bipartite Matching1252 kb
Week 04Lecture 10Stable Matchings and Faster Bipartite Matching995 kb
Week 04Lecture 11Factors & Perfect Matching in General Graphs988 kb
Week 04Lecture 12Matching in General Graphs: Edmonds’ Blossom Algorithm632 kb
Week 05Lecture13Connectivity and Paths: Cuts and Connectivity1261 kb
Week 05Lecture 14k-Connected Graphs1014 kb
Week 05Lecture 15Network Flow Problems1479 kb
Week 06Lecture 16Vertex Coloring and Upper Bounds1211 kb
Week 06Lecture 17Brooks’ Theorem and Color-Critical Graphs793 kb
Week 06Lecture 18Counting Proper Colorings668 kb
Week 07Lecture 19Planar Graphs1182 kb
Week 07Lecture 20Characterization of Planar Graphs1056 kb
Week 08Lecture 21Line Graphs and Edge-coloring759 kb
Week 08Lecture 22Hamiltonian Graph, Traveling Salesman Problem and NP-Completeness2280 kb
Week 08Lecture 23Connected Dominating Set and Distributed Algorithm1048 kb
Module NameDownloadDescriptionDownload Size
Week 01Week 0 Assignment 1Week 0 Assignment 1191 kb
Week 01Week 1 Assignment 1Week 1 Assignment 1322 kb
Week 02Week 2 Assignment 1Week 2 Assignment 1308 kb
Week 03Week 3 Assignment 1Week 3 Assignment 1311 kb
Week 04Week 4 Assignment 1Week 4 Assignment 1312 kb
Week 05Week 5 Assignment 1Week 5 Assignment 1302 kb
Week 06Week 6 Assignment 1Week 6 Assignment 1199 kb
Week 07Week 7 Assignment 1Week 7 Assignment 1308 kb
Week 08Week 8 Assignment 1Week 8 Assignment 1229 kb

Sl.No Chapter Name English
1Graph Theory: Introduction Download
Verified
2Paths, Cycles, and TrailsDownload
Verified
3Eulerian Circuits, Vertex Degrees and Counting Download
Verified
4The Chinese Postman Problem and Graphic Sequences Download
Verified
5Trees and DistanceDownload
Verified
6Spanning Trees and Enumeration Download
Verified
7Matchings and CoversDownload
Verified
8Independent Sets, Covers and Maximum Bipartite Matching Download
Verified
9Weighted Bipartite MatchingDownload
Verified
10Stable Matchings and Faster Bipartite MatchingDownload
Verified
11Factors & Perfect Matching in General GraphsDownload
Verified
12Matching in General Graphs: Edmonds’ Blossom AlgorithmDownload
Verified
13Connectivity and Paths: Cuts and Connectivity Download
Verified
14k-Connected GraphsDownload
Verified
15Network Flow Problems Download
Verified
16Vertex Coloring and Upper Bounds Download
Verified
17Brooks’ Theorem and Color-Critical GraphsDownload
Verified
18Counting Proper ColoringsDownload
Verified
19Planar GraphsDownload
Verified
20Characterization of Planar GraphsDownload
Verified
21Line Graphs and Edge-coloring Download
Verified
22Hamiltonian Graph, Traveling Salesman Problem and NP-CompletenessDownload
Verified
23Connected Dominating Set and Distributed AlgorithmDownload
Verified


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