![]() |
Coloring MapsMapmakers follow two rules in coloring maps:
|
| Figure 1 is a map of Utah, Colorado, Arizona, and New Mexico. We could
use a different color for each state, but following the mapmakers' rules,
we can use fewer colors. Color the map with the fewest possible colors.
If the states touch at only a single point, they can be of the same color.
1. How many colors are required? _______________ |
![]() |
![]() |
Figure 2 is a map of another portion of the western United States.
How many colors do we need for this map if we follow the mapmakers' rules?
|
| Test your conjecture by coloring figure 3.
|
For each of the regional maps in figure 4, determine the fewest colors
necessary to color the states following the mapmakers' rules.
|
|
![]() |
| 1. Two | 4. Four | 7. No | 10. Yes; Michigan and Virginia |
| 2. No | 5. a, b, c | 8. Maybe | 11. Yes |
| 3. Yes | 6. None | 9. Yes | 12. Not if the map is in a plane |
| Editor: | Johnny W. Lott, University of Montana, Missoula, MT 59812 |
| Editorial Panel: | Carol Findell, Boston University, Boston, MA 02215
Judy Olson, Western Illinois University, Macomb, IL 61455 Daniel J. Teague, North Carolina School of Science and Mathematics, Durham, NC 27705 |
| Editorial Coordinator: | Joan Armistead |
| Production Assistants: | Ann M. Butterfield, Sheila C. Gorg |