OpenStax, Contemporary Mathematics §12.4 Navigating Graphs · Example 2 · Combinatorics · Graph theory
Navigating Graphs · Example 2
Find a coloring of the graph in the figure, which uses four colors or fewer. Use the resulting coloring as a guide to recolor the map in the figure. How many colors did you use? Does this support the conclusion of the Four-Color Theorem? If so, how?
Its source prints no answer for this problem, so there's nothing to check against.
OpenStax, Contemporary Mathematics · §12.4 Navigating Graphs · Example 2
Stuck? A gentle nudge
No hints for this one.
Your working
Check your full solution
Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.