Four Color Theorem Map Puzzle: Printable Worksheets & Graph Coloring Guide

In 1852, a botany student named Francis Guthrie made an astonishing observation while coloring a map of the counties of England: he never needed more than four colors to ensure no two neighboring counties shared the same shade.

He asked his brother Frederick, who asked the renowned mathematician Augustus De Morgan. It took 124 years, thousands of failed proofs, and over 1,200 hours of supercomputer computation by Kenneth Appel and Wolfgang Haken in 1976 to prove Guthrie right.

Today, the Four Color Theorem is one of the most celebrated gateways into topology and computer science. Here is your classroom guide, complete with printable worksheet maps and strategies to master graph coloring.

1. The Rules of Planar Map Coloring

To turn the theorem into a logic puzzle, follow three universal constraints:

Shared Border Constraint: Two regions that share a border edge of measurable length must have different colors.
Point-Sharing Exemption: Regions that meet only at an infinitesimal point (like a chessboard corner or the US Four Corners) can share the same color.
The Four-Color Cap: You may only use four colors (e.g., Red, Blue, Green, Yellow). If you are forced to reach for a fifth color, backtrack! A four-color solution is mathematically guaranteed to exist for every planar map.

2. The Mathematician’s Secret: Planar Dual Graphs

Cartographers see countries; mathematicians see graphs:

Map View:                     Dual Graph View:
+---------+---------+         (A)-------(B)
|         |         |          | \     / |
|    A    |    B    |          |  \   /  |
|         |         |          |   (C)   |
+----+----+----+----+          |  /   \  |
|    |    C    |    |          | /     \ |
| D  +---------+ E  |         (D)-------(E)
+----+---------+----+

Every enclosed territory becomes a vertex (node), and every shared border becomes an edge (connecting line). Coloring the map is identical to coloring the graph so that no two connected nodes share a color (the classic Vertex Coloring Problem in computer science and compiler register allocation).

3. Printable Worksheet Maps (Print to PDF)

Below are three printable challenge templates designed for classroom centers, homeschool notebooks, or quiet road trips.

How to print: Press Cmd+P (Mac) or Ctrl+P (Windows) $\to$ choose “Save as PDF” or select your classroom printer.

========================================================================
CHALLENGE 1: THE WHEEL & PETALS (Beginner / Grade 3-5)
------------------------------------------------------------------------
            / \
          /  1  \
        /---------\
       | \   |   / |
       |  \  0  /  |     * Rule: Color Center (0) and 6 Petals (1-6).
       | 6 \ | / 2 |     * Hint: Can you do it with only 3 colors?
       |----+----+ |             Why or why not?
       | 5 / | \ 3 |
       |  /  4  \  |
        \---------/

========================================================================
CHALLENGE 2: THE ENCLAVE ARCHIPELAGO (Intermediate / Grade 5-7)
------------------------------------------------------------------------
   +-----------------------+-----------------------+
   |                       |                       |
   |        NORTH          |        EAST           |
   |                       |                       |
   +-----------+-----------+-----------+-----------+
   |           |       CENTRAL         |           |
   |   WEST    |     (Surrounded)      |   SOUTH   |
   |           |                       |           |
   +-----------+-----------------------+-----------+
   * Test your coloring: Notice how the central enclave constrains
     the perimeter regions.
========================================================================

4. Interactive Digital Lab

Prefer to solve without markers or paper?

Launch our free, interactive Four Color Map Puzzle on Math Playground:

Tap-to-paint color palette with vibrant rose, sky, emerald, and amber hues;
Real-time topological conflict highlighting (adjacent borders pulse red if colors clash);
Progressive difficulty from simple geometric rings to complex dual-core territories.

For more graph theory and spatial deduction challenges, try our Akari Light Up Puzzle and Coordinate Boat Race.

常见问题

What is the Four Color Theorem? +

The Four Color Theorem states that given any separation of a plane into contiguous regions (such as a political map of countries), no more than four colors are required to color the regions so that no two adjacent regions sharing a boundary line share the same color.

Do regions that meet only at a single point count as adjacent? +

No. In topology and cartography, touching at a single corner or point (like the Four Corners monument in the American Southwest) does not count as an adjacent border. Regions must share a boundary segment with non-zero length to be considered adjacent.

How do I print these map puzzle worksheets as a PDF? +

Use your browser's built-in print dialog (Cmd+P on Mac, Ctrl+P on Windows) and select 'Save as PDF'. All worksheet maps are styled to print crisp, high-resolution line art without ads or background clutter.

Can I play the Four Color Map puzzle interactively online? +

Yes! You can play the Four Color Map Puzzle directly in your browser on Math Playground with instant conflict detection and zero sign-up.