# Advanced Graph Theory

- Institution: IIT Patna
- Department: Computer Science and Engineering
- Teacher: Prof. Rajiv Misra
- Level: Undergraduate
- Language: English
- Subjects: Computer science, Engineering
- Source: [NPTEL](https://nptel.ac.in/courses/106104170)
- Licence: [CC BY-NC-SA](https://nptel.ac.in/faq) (Non-commercial use only.)
- Syllabus: [at the source](https://nptel.ac.in/courses/106104170)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

## Lectures

1. [Graph Theory: Introduction](https://invisiblenetwork.ai/learn/nptel/106104170/ec7c71ecc63a) (Video)
2. [Paths, Cycles, and Trails](https://invisiblenetwork.ai/learn/nptel/106104170/c5bed75544f4) (Video)
3. [Eulerian Circuits, Vertex Degrees and Counting](https://invisiblenetwork.ai/learn/nptel/106104170/7945d2d5ec51) (Video)
4. [The Chinese Postman Problem and Graphic Sequences](https://invisiblenetwork.ai/learn/nptel/106104170/ae65ffee9296) (Video)
5. [Trees and Distance](https://invisiblenetwork.ai/learn/nptel/106104170/585417a02dcd) (Video)
6. [Spanning Trees and Enumeration](https://invisiblenetwork.ai/learn/nptel/106104170/623be7ffcc50) (Video)
7. [Matchings and Covers](https://invisiblenetwork.ai/learn/nptel/106104170/2b9252b80b50) (Video)
8. [Independent Sets, Covers and Maximum Bipartite Matching](https://invisiblenetwork.ai/learn/nptel/106104170/5c514b0ab577) (Video)
9. [Weighted Bipartite Matching](https://invisiblenetwork.ai/learn/nptel/106104170/cd29d09264cb) (Video)
10. [Stable Matchings and Faster Bipartite Matching](https://invisiblenetwork.ai/learn/nptel/106104170/e5f0606f4b2a) (Video)
11. [Factors & Perfect Matching in General Graphs](https://invisiblenetwork.ai/learn/nptel/106104170/b71283b1b50c) (Video)
12. [Matching in General Graphs: Edmonds' Blossom Algorithm](https://invisiblenetwork.ai/learn/nptel/106104170/bd802711b767) (Video)
13. [Connectivity and Paths: Cuts and Connectivity](https://invisiblenetwork.ai/learn/nptel/106104170/f27935e7f652) (Video)
14. [k-Connected Graphs](https://invisiblenetwork.ai/learn/nptel/106104170/815112157d42) (Video)
15. [Network Flow Problems](https://invisiblenetwork.ai/learn/nptel/106104170/d8931d82c397) (Video)
16. [Vertex Coloring and Upper Bounds](https://invisiblenetwork.ai/learn/nptel/106104170/f0e1ace9f4c1) (Video)
17. [Brooks' Theorem and Color-Critical Graphs](https://invisiblenetwork.ai/learn/nptel/106104170/1f08589cad63) (Video)
18. [Counting Proper Colorings](https://invisiblenetwork.ai/learn/nptel/106104170/46f3bcc37b41) (Video)
19. [Planar Graphs](https://invisiblenetwork.ai/learn/nptel/106104170/86fda737b691) (Video)
20. [Characterization of Planar Graphs](https://invisiblenetwork.ai/learn/nptel/106104170/925868f96797) (Video)
21. [Line Graphs and Edge-coloring](https://invisiblenetwork.ai/learn/nptel/106104170/c93dd1489838) (Video)
22. [Hamiltonian Graph, Traveling Salesman Problem and NP-Completeness](https://invisiblenetwork.ai/learn/nptel/106104170/ebc5b9b855cd) (Video)
23. [Connected Dominating Set and Distributed Algorithm](https://invisiblenetwork.ai/learn/nptel/106104170/693594379f40) (Video)
24. [Live Session 10-03-2021](https://invisiblenetwork.ai/learn/nptel/106104170/ec7c71ecc63a-2) (Video)