Toggle navigation
Institute
IISc Bangalore
IIT Bombay
IIT Delhi
IIT Guwahati
IIT Kanpur
IIT Kharagpur
IIT Madras
IIT Roorkee
Discipline
Aerospace Engineering
Atmospheric Science
Basic courses
Biotechnology
Chemical Engineering
Chemistry and Biochemistry
Civil Engineering
Computer Science and Engineering
Electrical Engineering
Electronics & Communication Engineering
Engineering Design
General
Humanities and Social Sciences
Management
Mathematics
Mechanical Engineering
Home
Computer Sc. & Eng.
Graph Theory
Lecture# 32
'More on network flows: Circulations' Video Lecture
More on network flows: Circulations
Course
:
Graph Theory
Discipline
:
Computer Science and Engineering
Faculty
: Dr. L. Sunil Chandran
Institute
:
IISc Bangalore
More on network flows: Circulations
- Browse through
Graph Theory (Computer Science and Engineering)
Video Lectures by
Dr. L. Sunil Chandran
from
IISc Bangalore
through NPTEL.
Course
:
Graph Theory
Discipline
:
Computer Science and Engineering
Faculty
: Dr. L. Sunil Chandran
Institute
:
IISc Bangalore
NEXT LECTURE >>
Circulations and tensions
Download this video in MP4, FLV & 3GP formats
Format
Size
Download
MP4
494 MB
MP4 Video Download Link 1
MP4
494 MB
MP4 Video Download Link 2
FLV
133 MB
FLV Video Download Link 1
FLV
133 MB
FLV Video Download Link 2
3gp
63 MB
3gp Video Download Link 1
3gp
63 MB
3gp Video Download Link 2
Search Courses by Discipline & Institute
Search Courses
Discipline
All Disciplines
Aerospace Engineering
Atmospheric Science
Basic courses
Biotechnology
Chemical Engineering
Chemistry and Biochemistry
Civil Engineering
Computer Science and Engineering
Electrical Engineering
Electronics and Communication Engineering
Engineering Design
General
Humanities and Social Sciences
Management
Mathematics
Mechanical Engineering
Institute
All Institutes
IISc Bangalore
IIT Bombay
IIT Delhi
IIT Guwahati
IIT Kanpur
IIT Kharagpur
IIT Madras
IIT Roorkee
SASTRA University
Search
Course Video Lectures
Introduction: Vertex cover and independent se..
Matchings: Konig’s theorem and Hall’s theorem
More on Hall’s theorem and some applications
Tutte’s theorem on existence of a perfect mat..
More on Tutte’s theorem
More on Matchings
Dominating set, path cover
Gallai - Millgram theorem, Dilworth’s theorem
Connectivity: 2-connected and 3- connected gr..
Menger’s theorem
More on connectivity: k- linkedness
Minors, topological minors and more on k- lin..
Vertex coloring: Brooks theorem
More on vertex coloring
Edge coloring: Vizing’s theorem
Proof of Vizing’s theorem, Introduction to pl..
5- coloring planar graphs, Kuratowsky’s theor..
Proof of Kuratowsky’s theorem, List coloring
List chromatic index
Adjacency polynomial of a graph and combinato..
Chromatic polynomial, k - critical graphs
Gallai-Roy theorem, Acyclic coloring, Hadwige..
Perfect graphs: Examples
Interval graphs, chordal graphs
Proof of weak perfect graph theorem (WPGT)
Second proof of WPGT, Some non-perfect graph ..
More special classes of graphs
Boxicity,Sphericity, Hamiltonian circuits
More on Hamiltonicity: Chvatal’s theorem
Chvatal’s theorem, toughness, Hamiltonicity a..
Network flows: Max flow mincut theorem
More on network flows: Circulations
Circulations and tensions
More on circulations and tensions, flow numbe..
Random graphs and probabilistic method: Preli..
Probabilistic method: Markov’s inequality, Ra..
Probabilistic method: Graphs of high girth an..
Probabilistic method: Second moment method, L..
Graph minors and Hadwiger’s conjecture
More on graph minors, tree decompositions
2015. EngineeringVideoLectures.com