Graph Theory
Graph Theory 2022-23
Lecture 1: Introduction to Graph Theory [Slide]
Lecture 2: Graphs Related Terminologies [Slide]
Lecture 3: Specific Classes of Graphs [Slide]
Lecture 4: Regular Graphs and Degree Sequence [Slide]
Lecture 5: Subgraphs and Digraphs[Slide]
Lecture 6: Walks, Paths and Cycles in a Graph [Slide]
Lecture 7: Graph and Digraph Connectivity [Slide]
Lecture 8: Graph Isomorphism [Slide]
Lecture 9: Introduction to Trees [Slide]
Lecture 10: Centers in Trees [Slide]
Lecture 11: Spanning Trees and Adjacency Matrix [Slide]
Lecture 12: The number of Spanning Trees [Slide]
Lecture 13: Minimum Cost Spanning Trees [Slide]
Lecture 14: Introduction to Eulerian Graphs [Slide]
Lecture 15: Fleury Algorithm for Eulerian Graphs [Slide]
Lecture 16: Introduction to Hamiltonian Graphs [Slide]
Lecture 17: Sufficient Condition for Hamiltonian Graphs [Slide]
Lecture 18: Graph Algorithms BFS and DFS [Slide]
Lecture 19: Dijkstra's Shortest Path Algorithm [Slide]
Lecture 20: Edge Connectivity [Slide]
Lecture 21: Vertex Connectivity and Whitney Theorem [Slide]
Lecture 22: Blocks in a Connected Graph [Slide]
Lecture 23: Introduction to Network Flow [Slide]
Lecture 24: Ford-Fulkerson Algorithm for Maximum Flow [Slide]
Lecture 25: Minimum Cut [Slide]
Lecture 26: Disjoint Paths [Slide]
Lecture 27: Introduction to Planar Graphs [Slide]
Lecture 28: Euler Formula and Maximal Planar Graphs [Slide]
Lecture 29: Kuratowski Theorem [Slide]
Graph Theory 2021-22
Lecture 1: Introduction to Graph Theory [Slide] [Lecture]
Lecture 2: Specific Classes of Graphs [Slide] [Lecture]
Lecture 3: Regular Graphs and Degree Sequence [Slide] [Lecture]
Lecture 4: Subgraphs and Digraphs[Slide] [Lecture]
Tutorial Sheet Chapter 1 [Lecture]
Lecture 5: Walks in a Graph [Slide] [Lecture]
Lecture 6: Connected Graphs [Slide] [Lecture]
Lecture 7: Graph Isomorphism [Slide] [Lecture]
Tutorial Sheet Chapter 2 [Lecture]
Lecture 8: Introduction to Trees [Slide] [Lecture]
Lecture 9: Centers in Trees [Slide] [Lecture]
Tutorial Sheet Chapter 3 [Lecture]
Lecture 10: Spanning Trees and Adjacency Matrix [Slide] [Lecture]
Lecture 11: The number of Spanning Trees [Slide] [Lecture]
Lecture 12: Minimum Cost Spanning Trees [Slide] [Lecture]
Tutorial Sheet Chapter 4 [Lecture]
Lecture 13: Introduction to Eulerian Graphs [Slide] [Lecture]
Lecture 14: Fleury Algorithm for Eulerian Graphs [Slide] [Lecture]
Lecture 15: Introduction to Hamiltonian Graphs [Slide] [Lecture]
Lecture 16: Sufficient Condition for Hamiltonian Graphs [Slide] [Lecture]
Tutorial Sheet Chapter 5 Lecture
Lecture 17: Graph Algorithms BFS and DFS [Slide] [Lecture]
Lecture 18: Dijkstra's Shortest Path Algorithm [Slide] [Lecture]
Lecture 19: Edge Connectivity [Slide] [Lecture]
Lecture 20: Vertex Connectivity and Whitney Theorem [Slide] [Lecture]
Lecture 21: Blocks in a Connected Graph [Slide] [Lecture]
Lecture 22: Introduction to Network Flow [Slide] [Lecture]
Lecture 23: Ford-Fulkerson Algorithm and Minimum Cut Problem [Slide] [Lecture]
Lecture 24: Minimum Cut [Slide] [Lecture]
Lecture 25: Disjoint Paths [Slide] [Lecture]
Tutorial Sheet Chapter 6 Lecture
Lecture 26: Introduction to Planar Graphs [Slide] [Lecture]
Lecture 27: Euler Formula and Maximal Planar Graphs [Slide] [Lecture]
Lecture 28: Kuratowski Theorem [Slide] [Lecture]
Lecture 29: Wagner Theorem and Crossing Number [Slide] [Lecture]
Tutorial Sheet Chapter 7 Lecture
Lecture 30: Vertex Coloring and Chromatic Number [Slide] [Lecture]
Lecture 31: Vertex Coloring for Planar Graphs [Slide] [Lecture]
Lecture 32: Edge Coloring [Slide] [Lecture]
Tutorial Sheet Chapter 8 Lecture
Lecture 33: Matchings in Graph [Slide] [Lecture]
Lecture 34: Independence Number and Domination Number [Slide] [Lecture]
Lecture 35: Vertex Covering Number and Matching Number [Slide] [Lecture]
Lecture 36: Edge Covering Number [Slide] [Lecture]