Discrete Math II - 10.2.2 Special Graphs: Bipartite Graphs

This video is a deeper look at bipartite graphs. We look at both the definition of a bipartite graph and using graph coloring to determine if an existing graph can be redrawn as bipartite. In addition, we model real-life scenarios with bipartite graphs in an effort to create a complete matching and explore Hall's Marriage Theorem to determine if a complete matching is possible.

Video Chapters:
Intro 0:00
What is a Bipartite Graph/Redrawing with Graph Coloring 0:12
Bipartite Graph Matching 7:12
Graph Matching Practice 9:48
Hall's Marriage Theorem 12:08
Up Next 15:47

This playlist uses Discrete Mathematics and Its Applications, Rosen 8e

Power Point slide decks to accompany the videos can be found here:

The entire playlist can be found here:

[ItsDeveshA]

A really Under-rated video. The concept was really well explained-loved the Lecture. Thanks Kimberly for a good and a well explained lecture :)

[shjaaz]

You're a life saver ma'm thanks.