+ Add to collection

CURATOR

EXTRAS

  • Lifetime access. No limits!
  • Mobile accessibility
  • Add to wishlist

Computer - Graph Theory

+ Add to collection

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

Self-Study Content
  1. Mod-01 Lec-01 Introduction: Vertex cover and independent set

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  2. Mod-01 Lec-02 Matchings: Konig's theorem and Hall's theorem

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  3. Mod-01 Lec-03 More on Hall's theorem and some applications

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  4. Mod-01 Lec-04 Tutte's theorem on existence of a perfect matching

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  5. Mod-01 Lec-05 More on Tutte's theorem

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  6. Mod-01 Lec-06 More on Matchings

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  7. Mod-01 Lec-07 Dominating set, path cover

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  8. Mod-01 Lec-08 Gallai -- Millgram theorem, Dilworth's theorem

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  9. Mod-02 Lec-09 Connectivity: 2-connected and 3- connected graphs

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  10. Mod-02 Lec-10 Menger's theorem

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  11. Mod-02 Lec-11 More on connectivity: k- linkedness

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  12. Mod-02 Lec-12 Minors, topological minors and more on k- linkedness

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  13. Mod-03 Lec-13 Vertex coloring: Brooks theorem

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  14. Mod-03 Lec-14 More on vertex coloring

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  15. Mod-03 Lec-15 Edge coloring: Vizing's theorem

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  16. Mod-03 Lec-16 Proof of Vizing's theorem, Introduction to planarity

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  17. Mod-03 Lec-17 5- coloring planar graphs, Kuratowsky's theorem

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  18. Mod-03 Lec-18 Proof of Kuratowsky's theorem, List coloring

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  19. Mod-03 Lec-19 List chromatic index

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  20. Mod-03 Lec-20 Adjacency polynomial of a graph and combinatorial Nullstellensatz

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  21. Mod-03 Lec-21 Chromatic polynomial, k - critical graphs

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  22. Mod-03 Lec-22 Gallai-Roy theorem, Acyclic coloring, Hadwiger's conjecture

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  23. Mod-04 Lec-23 Perfect graphs: Examples

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  24. Mod-04 Lec-24 Interval graphs, chordal graphs

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  25. Mod-04 Lec-25 Proof of weak perfect graph theorem (WPGT)

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  26. Mod-04 Lec-26 Second proof of WPGT, Some non-perfect graph classes

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  27. Mod-04 Lec-27 More special classes of graphs

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  28. Mod-04 Lec-28 Boxicity,Sphericity, Hamiltonian circuits

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  29. Mod-04 Lec-29 More on Hamiltonicity: Chvatal's theorem

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  30. Mod-04 Lec-30 Chvatal's theorem, toughness, Hamiltonicity and 4-color conjecture

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  31. Mod-05 Lec-31 Network flows: Max flow mincut theorem

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  32. Mod-05 Lec-32 More on network flows: Circulations

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  33. Mod-05 Lec-33 Circulations and tensions

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  34. Mod-05 Lec-34 More on circulations and tensions, flow number and Tutte's flow conjectures

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  35. Mod-06 Lec-35 Random graphs and probabilistic method: Preliminaries

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  36. Mod-06 Lec-36 Probabilistic method: Markov's inequality, Ramsey number

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  37. Mod-06 Lec-37 Probabilistic method: Graphs of high girth and high chromatic number

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  38. Mod-06 Lec-38 Probabilistic method: Second moment method, Lovasz local lemma

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  39. Mod-07 Lec-39 Graph minors and Hadwiger's conjecture

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

  40. Mod-07 Lec-40 More on graph minors, tree decompositions

    Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore

Reviews

Ask your own question. Don't worry, it's completely free!