2
Graph Theory. Instructor: Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore
Graph Theory. Instructor: Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore.
Graph Theory. Instructor: Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore.
1027 years, 8 months
37
Course Currilcum
-
- Lecture 01 – Introduction to Cryptography Unlimited
- Lecture 02 – Matchings: Konig’s Theorem and Hall’s Theorem Unlimited
- Lecture 03 – More on Hall’s Theorem and Some Applications Unlimited
- Lecture 04 – Tutte’s Theorem on Existence of a Perfect Matching Unlimited
- Lecture 05 – More on Tutte’s Theorem Unlimited
- Lecture 06 – More on Matchings Unlimited
- Lecture 07 – Dominating Set, Path Cover Unlimited
- Lecture 08 – Gallai-Milgram Theorem, Dilworth’s Theorem Unlimited
-
- Lecture 09 – Connectivity: 2-Connected and 3-Connected Graphs Unlimited
- Lecture 10 – Menger’s Theorem Unlimited
- Lecture 11 – More on Connectivity: K-Linkedness Unlimited
- Lecture 12 – Minors, Topological Minors and More on K-Linkedness Unlimited
- Lecture 13 – Vertex Coloring: Brooks’ Theorem Unlimited
- Lecture 15 – Edge Coloring: Vizing’s Theorem Unlimited
- Lecture 16 – Proof of Vizing’s Theorem, Introduction to Planarity Unlimited
- Lecture 17 – 5-Coloring Planar Graphs, Kuratowski’s Theorem Unlimited
- Lecture 18 – Proof of Kuratowski’s Theorem, List Coloring Unlimited
- Lecture 19 – List Chromatic Index Unlimited
- Lecture 20 – Adjacency Polynomial of a Graph and Combinatorial Nullstellensatz Unlimited
- Lecture 22 – Gallai-Roy Theorem, Acyclic Coloring, Hadwiger Conjecture Unlimited
- Lecture 31 – Network Flows: Max-Flow Min-Cut Theorem Unlimited
- Lecture 32 – More on Network Flows: Circulations Unlimited
- Lecture 33 – Circulations and Tensions Unlimited
- Lecture 34 – More on Circulations and Tensions, Flow Number and Tutte’s Flow Conjectures Unlimited
- Lecture 39 – Graph Minors and Hadwiger Conjecture Unlimited
- Lecture 40 – More on Graph Minors, Tree Decompositions Unlimited
