Lecture 1 of 24Week 01
Graph Theory: Introduction
Prof. Rajiv Misra · IIT Patna
Credits and licence
- From
- Advanced Graph Theory, IIT Patna (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IIT Kanpur.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Graph Theory: Introduction
- Paths, Cycles, and Trails
- Eulerian Circuits, Vertex Degrees and Counting
- The Chinese Postman Problem and Graphic Sequences
- Trees and Distance
- Spanning Trees and Enumeration
- Matchings and Covers
- Independent Sets, Covers and Maximum Bipartite Matching
- Weighted Bipartite Matching
- Stable Matchings and Faster Bipartite Matching
- Factors & Perfect Matching in General Graphs
- Matching in General Graphs: Edmonds' Blossom Algorithm
- Connectivity and Paths: Cuts and Connectivity
- k-Connected Graphs
- Network Flow Problems
- Vertex Coloring and Upper Bounds
- Brooks' Theorem and Color-Critical Graphs
- Counting Proper Colorings
- Planar Graphs
- Characterization of Planar Graphs
- Line Graphs and Edge-coloring
- Hamiltonian Graph, Traveling Salesman Problem and NP-Completeness
- Connected Dominating Set and Distributed Algorithm
- Live Session 10-03-2021