| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Graph Theory: Introduction | Download |
| 2 | Paths, Cycles, and Trails | Download |
| 3 | Eulerian Circuits, Vertex Degrees and Counting | Download |
| 4 | The Chinese Postman Problem and Graphic Sequences | Download |
| 5 | Trees and Distance | Download |
| 6 | Spanning Trees and Enumeration | Download |
| 7 | Matchings and Covers | Download |
| 8 | Independent Sets, Covers and Maximum Bipartite Matching | Download |
| 9 | Weighted Bipartite Matching | Download |
| 10 | Stable Matchings and Faster Bipartite Matching | Download |
| 11 | Factors & Perfect Matching in General Graphs | Download |
| 12 | Matching in General Graphs: Edmonds’ Blossom Algorithm | Download |
| 13 | Connectivity and Paths: Cuts and Connectivity | Download |
| 14 | k-Connected Graphs | Download |
| 15 | Network Flow Problems | Download |
| 16 | Vertex Coloring and Upper Bounds | Download |
| 17 | Brooks’ Theorem and Color-Critical Graphs | Download |
| 18 | Counting Proper Colorings | Download |
| 19 | Planar Graphs | Download |
| 20 | Characterization of Planar Graphs | Download |
| 21 | Line Graphs and Edge-coloring | Download |
| 22 | Hamiltonian Graph, Traveling Salesman Problem and NP-Completeness | Download |
| 23 | Connected Dominating Set and Distributed Algorithm | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Graph Theory: Introduction | Download Verified |
| 2 | Paths, Cycles, and Trails | Download Verified |
| 3 | Eulerian Circuits, Vertex Degrees and Counting | Download Verified |
| 4 | The Chinese Postman Problem and Graphic Sequences | Download Verified |
| 5 | Trees and Distance | Download Verified |
| 6 | Spanning Trees and Enumeration | Download Verified |
| 7 | Matchings and Covers | Download Verified |
| 8 | Independent Sets, Covers and Maximum Bipartite Matching | Download Verified |
| 9 | Weighted Bipartite Matching | Download Verified |
| 10 | Stable Matchings and Faster Bipartite Matching | Download Verified |
| 11 | Factors & Perfect Matching in General Graphs | Download Verified |
| 12 | Matching in General Graphs: Edmonds’ Blossom Algorithm | Download Verified |
| 13 | Connectivity and Paths: Cuts and Connectivity | Download Verified |
| 14 | k-Connected Graphs | Download Verified |
| 15 | Network Flow Problems | Download Verified |
| 16 | Vertex Coloring and Upper Bounds | Download Verified |
| 17 | Brooks’ Theorem and Color-Critical Graphs | Download Verified |
| 18 | Counting Proper Colorings | Download Verified |
| 19 | Planar Graphs | Download Verified |
| 20 | Characterization of Planar Graphs | Download Verified |
| 21 | Line Graphs and Edge-coloring | Download Verified |
| 22 | Hamiltonian Graph, Traveling Salesman Problem and NP-Completeness | Download Verified |
| 23 | Connected Dominating Set and Distributed Algorithm | Download Verified |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Download |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |