Graph theory: paths, trees, coloring
Discrete Mathematics · Engineering
Study notes
Color a map of 4 regions where each touches the others: region A touches B,C,D. Try 2 colors: A red forces B,C,D blue, but B touches C so conflict. Need 3 colors minimum; the chromatic number is 3. The Four Color Theorem says no planar map needs more than 4.