<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<channel>
<title>Graph Theory Online Course,  IISc Bangalore</title>
<link>http://freevideolectures.com</link>
<description><![CDATA[In computer science, graph theory is used extensively. The intension of this course is to introduce the subject of graph theory to computer science students in a thorough way.<br />
While the course will cover all elementary concepts such as coloring, covering, hamiltonicity, planarity, connectivity and so on, it will also introduce the students to some advanced concepts. Graph Theory Online Course,  IISc Bangalore. Subscribed to the feed and get updated]]></description>
<item>
<title>Lecture 1: Mod-01 Lec-01 Introduction: Vertex cover and independent set</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/1</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 2: Mod-01 Lec-02 Matchings: Konig's theorem and Hall's theorem</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/2</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 3: Mod-01 Lec-03 More on Hall's theorem and some applications</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/3</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 4: Mod-01 Lec-04 Tutte's theorem on existence of a perfect matching</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/4</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 5: Mod-01 Lec-05 More on Tutte's theorem</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/5</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 6: Mod-01 Lec-06 More on Matchings</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/6</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 7: Mod-01 Lec-07 Dominating set, path cover</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/7</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 8: Mod-01 Lec-08 Gallai -- Millgram theorem, Dilworth's theorem</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/8</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 9: Mod-02 Lec-09 Connectivity: 2-connected and 3- connected graphs</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/9</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 10: Mod-02 Lec-10 Menger's theorem</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/10</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 11: Mod-02 Lec-11 More on connectivity: k- linkedness</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/11</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 12: Mod-02 Lec-12 Minors, topological minors and more on k- linkedness</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/12</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 13: Mod-03 Lec-13 Vertex coloring: Brooks theorem</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/13</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 14: Mod-03 Lec-14 More on vertex coloring</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/14</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 15: Mod-03 Lec-15 Edge coloring: Vizing's theorem</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/15</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 16: Mod-03 Lec-16 Proof of Vizing's theorem, Introduction to planarity</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/16</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 17: Mod-03 Lec-17  5- coloring planar graphs, Kuratowsky's theorem</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/17</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 18: Mod-03 Lec-18 Proof of Kuratowsky's theorem, List coloring</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/18</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 19: Mod-03 Lec-19 List chromatic index</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/19</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 20: Mod-03 Lec-20 Adjacency polynomial of a graph and combinatorial Nullstellensatz</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/20</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 21: Mod-03 Lec-21 Chromatic polynomial, k - critical graphs</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/21</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 22: Mod-03 Lec-22 Gallai-Roy theorem, Acyclic coloring, Hadwiger's conjecture</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/22</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 23: Mod-04 Lec-23 Perfect graphs: Examples</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/23</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 24: Mod-04 Lec-24 Interval graphs, chordal graphs</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/24</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 25: Mod-04 Lec-25 Proof of weak perfect graph theorem (WPGT)</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/25</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 26: Mod-04 Lec-26 Second proof of WPGT, Some non-perfect graph classes</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/26</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 27: Mod-04 Lec-27 More special classes of graphs</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/27</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 28: Mod-04 Lec-28 Boxicity,Sphericity, Hamiltonian circuits</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/28</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 29: Mod-04 Lec-29 More on Hamiltonicity: Chvatal's theorem</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/29</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 30: Mod-04 Lec-30 Chvatal's theorem, toughness, Hamiltonicity and 4-color conjecture</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/30</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 31: Mod-05 Lec-31 Network flows: Max flow mincut theorem</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/31</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 32: Mod-05 Lec-32 More on network flows: Circulations</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/32</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 33: Mod-05 Lec-33 Circulations and tensions</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/33</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 34: Mod-05 Lec-34 More on circulations and tensions, flow number and Tutte's flow conjectures</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/34</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 35: Mod-06 Lec-35 Random graphs and probabilistic method: Preliminaries</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/35</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 36: Mod-06 Lec-36 Probabilistic method: Markov's inequality, Ramsey number</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/36</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 37: Mod-06 Lec-37 Probabilistic method: Graphs of high girth and high chromatic number</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/37</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 38: Mod-06 Lec-38 Probabilistic method: Second moment method, Lovasz local lemma</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/38</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 39: Mod-07 Lec-39 Graph minors and Hadwiger's conjecture</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/39</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
<item>
<title>Lecture 40: Mod-07 Lec-40 More on graph minors, tree decompositions</title>
<link>http://freevideolectures.com/Course/3019/Graph-Theory/40</link>
<pubDate>Wed, 23 May 2012 00:00:00 -0600</pubDate>
<description><![CDATA[Graph 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]]></description>
</item>
</channel>
</rss>