Math 2.0

Resources / course

Graph Theory RDHAK99S1R

URIm2://res/RDHAK99S1R
Kindcourse
CreatorsSoumen Maity (instructor)
Date2017-08-21
Scopein

Expressions

e1: edition

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

Catalogue records