2- Course Aim :-

Introduction to graphs, Max-flow Min-cut theorem, Algorithms for computing maximum s-t flows in graphs. Algorithms for computing the minimum cut in a graph, Edge and vertex connectivity of graphs and Menger's theorem. Maximum matching, Hall's theorem, algorithms for computing maximum matching in weighted and unweighted graphs. Arborescences and algorithm for computing minimum arborescence, Edmonds therorem for disjoint arborescences. Planar graphs and algorithms for checking for planarity. Edge and vertex colouring of graphs. Independent sets and perfect graphs, Extremal graph theory.