IISER Pune · Mathematics & Statistics

Graph Theory

Prof. Soumen Maity · 39 free video lectures

39 video lectures. Topics: Basic Concepts; Basic Concepts 1; Eulerian and Hamiltonian Graph; Eulerian and Hamiltonian Graph 1; Bipartite Graph; Bipartite Graph (Contd); Diameter of a graph; Isomorphic graphs; Diameter of a graph; Isomorphic graphs (Contd); Minimum Spanning Tree; Minimum Spanning…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Basic Concepts
  2. Basic Concepts 1
  3. Eulerian and Hamiltonian Graph
  4. Eulerian and Hamiltonian Graph 1
  5. Bipartite Graph
  6. Bipartite Graph (Contd)
  7. Diameter of a graph; Isomorphic graphs
  8. Diameter of a graph; Isomorphic graphs (Contd)
  9. Minimum Spanning Tree
  10. Minimum Spanning Trees (Cont.)
  11. Minimum Spanning Trees Cont 1
  12. Minimum Spanning Trees (Cont 2)
  13. Maximum Matching in Bipartite Graph
  14. Maximum Matching in Bipartite Graph 1
  15. Hall's Theorem and Konig's Theorem
  16. Hall's Theorem and Konig's Theorem 1
  17. Independent Set and Edge Cover
  18. Independent Set and Edge Cover 1
  19. Matching in General Graphs
  20. Proof of Halls Theorem
  21. Stable Matching
  22. Gale-Shapley Algorithm
  23. Graph Connectivity
  24. Graph Connectivity 1
  25. 2-Connected Graphs
  26. 2-Connected Graphs 1
  27. Subdivision of an edge; 2-edge-connected graphs
  28. Problems Related to Graphs Connectivity
  29. Flow Network
  30. Residual Network and Augmenting Path
  31. Augmenting Path Algorithm
  32. Max-Flow and Min-Cut
  33. Max-Flow and Min-Cut Theorem
  34. Vertex Colouring
  35. Chromatic Number and Max. Degree
  36. Edge Colouring
  37. Planar Graphs & Euler's Formula
  38. Characterization Of Planar Graphs
  39. Colouring of Planar Graphs

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IISER Pune.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights