Video Transcript:

Auto Scroll Hide
NameDownloadDownload Size
Lecture NoteDownload as zip file24M


New Assignments
Module NameDownload
W0A1W0A1
W1A1W1A1
W2A1W2A1
W3A1W3A1
W4A1W4A1
W5A1W5A1
W6A1W6A1
W8A1W8A1


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

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