Lesson 14 of 20 · about 15 min
Coloring and bipartite graphs
Give every vertex a color so that neighbors never match. That simple rule schedules exams, assigns radio frequencies and allocates computer memory. You'll color graphs by hand and with a greedy algorithm, and learn exactly when two colors are enough.
🔓 Unlock this lesson
This lesson is part of the DoingCamp Pass. Members get every lesson in every course, with all the interactive visuals, coding exercises and challenges.
In this lesson you'll learn:
- Graph coloring
- Bipartite graph
Free to try in F06 Discrete Math:
The first 3 lessons of every course are free, no account needed.