Lecture 35 of 39week-07
Chromatic Number and Max. Degree
Prof. Soumen Maity · IISER Pune
Credits and licence
- From
- Graph Theory, IISER Pune (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 Madras.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Basic Concepts
- Basic Concepts 1
- Eulerian and Hamiltonian Graph
- Eulerian and Hamiltonian Graph 1
- Bipartite Graph
- Bipartite Graph (Contd)
- Diameter of a graph; Isomorphic graphs
- Diameter of a graph; Isomorphic graphs (Contd)
- Minimum Spanning Tree
- Minimum Spanning Trees (Cont.)
- Minimum Spanning Trees Cont 1
- Minimum Spanning Trees (Cont 2)
- Maximum Matching in Bipartite Graph
- Maximum Matching in Bipartite Graph 1
- Hall's Theorem and Konig's Theorem
- Hall's Theorem and Konig's Theorem 1
- Independent Set and Edge Cover
- Independent Set and Edge Cover 1
- Matching in General Graphs
- Proof of Halls Theorem
- Stable Matching
- Gale-Shapley Algorithm
- Graph Connectivity
- Graph Connectivity 1
- 2-Connected Graphs
- 2-Connected Graphs 1
- Subdivision of an edge; 2-edge-connected graphs
- Problems Related to Graphs Connectivity
- Flow Network
- Residual Network and Augmenting Path
- Augmenting Path Algorithm
- Max-Flow and Min-Cut
- Max-Flow and Min-Cut Theorem
- Vertex Colouring
- Chromatic Number and Max. Degree
- Edge Colouring
- Planar Graphs & Euler's Formula
- Characterization Of Planar Graphs
- Colouring of Planar Graphs