BrighterTube

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

nptelhrd2.25M subscribers

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Proves weak perfect graph theorem relating chromatic and clique numbers. Fundamental theorem characterizing perfect graphs through coloring properties.

A 57-minute video from nptelhrd: “Mod-04 Lec-25 Proof of weak perfect graph theorem (WPGT)”.

Programming & CSLectures

Video by nptelhrd, played through YouTube's embedded player.

Part of Computer - Graph Theory