filmov
tv
MATH 474 - Section 9.2 Planar Graph Colorings

Показать описание
In this video lecture, we discuss a famous, 160+ year old problem involving coloring maps. We translate the problem into a problem on the chromatic number of a planar graph G. We then discuss the famous 4-color theorem and prove the slightly less famous 5-color theorem.