Edge coloring: Vizing’s theorem
Brief of the Video:
In this lecture, Dr. L. Sunil Chandran from Department of Computer Science and Automation at IISc Bangalore further tackles k-constructible graphs.
Lecture videos are linked and streamed with permission from The National Programme on Technology Enhanced Learning (NPTEL), an initiative by seven IITs and the IISs for creating course contents in engineering and science, and funded by the Ministry of Human Resource Development. Copyright to this content is owned and maintained by the institutes participating in the NPTEL.