# Graph Theory

- Institution: IISER Pune
- Department: Mathematics
- Teacher: Prof. Soumen Maity
- Level: Undergraduate
- Language: English
- Subjects: Mathematics
- Source: [NPTEL](https://nptel.ac.in/courses/111106102)
- Licence: [CC BY-NC-SA](https://nptel.ac.in/faq) (Non-commercial use only.)
- Syllabus: [at the source](https://nptel.ac.in/courses/111106102)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

## Lectures

1. [Basic Concepts](https://invisiblenetwork.ai/learn/nptel/111106102/dfac38e2ec29) (Video)
2. [Basic Concepts 1](https://invisiblenetwork.ai/learn/nptel/111106102/4435b8c7d9b3) (Video)
3. [Eulerian and Hamiltonian Graph](https://invisiblenetwork.ai/learn/nptel/111106102/c0883070a93e) (Video)
4. [Eulerian and Hamiltonian Graph 1](https://invisiblenetwork.ai/learn/nptel/111106102/5c00f847aebf) (Video)
5. [Bipartite Graph](https://invisiblenetwork.ai/learn/nptel/111106102/387026f299d0) (Video)
6. [Bipartite Graph (Contd)](https://invisiblenetwork.ai/learn/nptel/111106102/65d24cc86e81) (Video)
7. [Diameter of a graph; Isomorphic graphs](https://invisiblenetwork.ai/learn/nptel/111106102/49a2dee2be24) (Video)
8. [Diameter of a graph; Isomorphic graphs (Contd)](https://invisiblenetwork.ai/learn/nptel/111106102/0fa5779c5cc9) (Video)
9. [Minimum Spanning Tree](https://invisiblenetwork.ai/learn/nptel/111106102/f6dd2452cf1b) (Video)
10. [Minimum Spanning Trees (Cont.)](https://invisiblenetwork.ai/learn/nptel/111106102/cd1ae08a1d13) (Video)
11. [Minimum Spanning Trees Cont 1](https://invisiblenetwork.ai/learn/nptel/111106102/130feabf23f1) (Video)
12. [Minimum Spanning Trees (Cont 2)](https://invisiblenetwork.ai/learn/nptel/111106102/32ecfbbdc3ae) (Video)
13. [Maximum Matching in Bipartite Graph](https://invisiblenetwork.ai/learn/nptel/111106102/010b43b42f26) (Video)
14. [Maximum Matching in Bipartite Graph 1](https://invisiblenetwork.ai/learn/nptel/111106102/20f9ee7c72bd) (Video)
15. [Hall's Theorem and Konig's Theorem](https://invisiblenetwork.ai/learn/nptel/111106102/facc3e518c54) (Video)
16. [Hall's Theorem and Konig's Theorem 1](https://invisiblenetwork.ai/learn/nptel/111106102/7d0c762b78c3) (Video)
17. [Independent Set and Edge Cover](https://invisiblenetwork.ai/learn/nptel/111106102/f2d88c1ccb5e) (Video)
18. [Independent Set and Edge Cover 1](https://invisiblenetwork.ai/learn/nptel/111106102/817633876015) (Video)
19. [Matching in General Graphs](https://invisiblenetwork.ai/learn/nptel/111106102/9c99ca9edf59) (Video)
20. [Proof of Halls Theorem](https://invisiblenetwork.ai/learn/nptel/111106102/38910d1356f3) (Video)
21. [Stable Matching](https://invisiblenetwork.ai/learn/nptel/111106102/f25ba86d66d7) (Video)
22. [Gale-Shapley Algorithm](https://invisiblenetwork.ai/learn/nptel/111106102/fba83e86130f) (Video)
23. [Graph Connectivity](https://invisiblenetwork.ai/learn/nptel/111106102/70344cd5ba09) (Video)
24. [Graph Connectivity 1](https://invisiblenetwork.ai/learn/nptel/111106102/ba1dcb2c8049) (Video)
25. [2-Connected Graphs](https://invisiblenetwork.ai/learn/nptel/111106102/585d8582c53e) (Video)
26. [2-Connected Graphs 1](https://invisiblenetwork.ai/learn/nptel/111106102/2739bb38395a) (Video)
27. [Subdivision of an edge; 2-edge-connected graphs](https://invisiblenetwork.ai/learn/nptel/111106102/12a95e8b22a7) (Video)
28. [Problems Related to Graphs Connectivity](https://invisiblenetwork.ai/learn/nptel/111106102/8b7ce2cb9285) (Video)
29. [Flow Network](https://invisiblenetwork.ai/learn/nptel/111106102/8a5314eff384) (Video)
30. [Residual Network and Augmenting Path](https://invisiblenetwork.ai/learn/nptel/111106102/00fdd98fbdc8) (Video)
31. [Augmenting Path Algorithm](https://invisiblenetwork.ai/learn/nptel/111106102/c435c357d0d8) (Video)
32. [Max-Flow and Min-Cut](https://invisiblenetwork.ai/learn/nptel/111106102/8d66b6288fb1) (Video)
33. [Max-Flow and Min-Cut Theorem](https://invisiblenetwork.ai/learn/nptel/111106102/f021516de202) (Video)
34. [Vertex Colouring](https://invisiblenetwork.ai/learn/nptel/111106102/4666c4f7613d) (Video)
35. [Chromatic Number and Max. Degree](https://invisiblenetwork.ai/learn/nptel/111106102/5fbc397ca1cd) (Video)
36. [Edge Colouring](https://invisiblenetwork.ai/learn/nptel/111106102/c33f40bef795) (Video)
37. [Planar Graphs & Euler's Formula](https://invisiblenetwork.ai/learn/nptel/111106102/971032a2b7f5) (Video)
38. [Characterization Of Planar Graphs](https://invisiblenetwork.ai/learn/nptel/111106102/7300819aff60) (Video)
39. [Colouring of Planar Graphs](https://invisiblenetwork.ai/learn/nptel/111106102/829ecd3654a8) (Video)