https://wiki.devclub.in/index.php?action=history&feed=atom&title=MTL768 2026-04-09T06:02:12Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=MTL768&diff=1658&oldid=prev 2026-03-04T10:14:57Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = MTL768<br /> | name = Graph Theory<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = <br /> | overlaps = MTL776<br /> }}<br /> <br /> == MTL768 : Graph Theory ==<br /> Introduction to Graphs: Definition and basic concepts; Trees: characterizations, counting of minimum spanning tree; Paths and Distance in Graphs: Basic Definitions, center and median of a graph, activity digraph and critical path; Eulerian Graphs: Definition and Characterization; Hamiltonian Graphs: Necessary and sufficient conditions, Planar Graphs: properties, dual, genus of a graph; Graph Coloring: vertex coloring, chromatic polynomials, edge coloring, planar graph coloring; Matching and Factorizations: maximum matching in bipartite graphs, maximum matching in general graphs, Hall&#039;s marriage theorem, factorization; Networks: The Max-flow min-cut theorem, connectivity and edge connectivity, Menger&#039;s theorem; Graph and Matrices.</div>

Prashantt492