Back To The Course Mod-01 Lec-01 Introduction: Vertex cover and independent set Free Video Tutorials and Notes Lectures Mod-01 Lec-06 More on Matchings Free Video Tutorials and Notes Lectures Mod-01 Lec-07 Dominating set, path cover Free Video Tutorials and Notes Lectures Mod-02 Lec-09 Connectivity: 2-connected and 3- connected graphs Free Video Tutorials and Notes Lectures Mod-02 Lec-11 More on connectivity: k- linkedness Free Video Tutorials and Notes Lectures Mod-02 Lec-12 Minors, topological minors and more on k- linkedness Free Video Tutorials and Notes Lectures Mod-03 Lec-13 Vertex coloring: Brooks theorem Free Video Tutorials and Notes Lectures Mod-03 Lec-14 More on vertex coloring Free Video Tutorials and Notes Lectures Mod-03 Lec-19 List chromatic index Free Video Tutorials and Notes Lectures Mod-03 Lec-21 Chromatic polynomial, k - critical graphs Free Video Tutorials and Notes Lectures Mod-03 Lec-20 Adjacency polynomial of a graph and combinatorial Nullstellensatz Free Video Tutorials and Notes Lectures Mod-04 Lec-23 Perfect graphs: Examples Free Video Tutorials and Notes Lectures Mod-04 Lec-24 Interval graphs, chordal graphs Free Video Tutorials and Notes Lectures Mod-04 Lec-25 Proof of weak perfect graph theorem (WPGT) Free Video Tutorials and Notes Lectures Computer - Graph Theory Free Video Tutorials and Notes LecturesMod-03 Lec-13 Vertex coloring: Brooks theorem Free Video Tutorials and Notes LecturesGraph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore. For more details on NPTEL visit http://nptel.iitm.ac.in