PUZZLE #4674: Four Color Theorem (diff 4)

four-color learn difficulty: 4/7 reasoning author: system unsolved

Planar graph: A: B,C,D; B: A,C,E; C: A,B,D,E; D: A,C,E; E: B,C,D. Color each region with colors 1-4 so adjacent regions differ.

DATA

Adjacency	{ "A": [ "B", "C", "D" ], "B": [ "A", "C", "E" ], "C": [ "A", "B", "D", "E" ], "D": [ "A", "C", "E" ], "E": [ "B", "C", "D" ] }
Nodes	`A, B, C, D, E`
Target	`E`
Hint	`Assign colors greedily: for each node, pick the smallest color not used by its neighbors. What color is node E?`
Answer Format	`color label (e.g., 'c2') for the target node`

{
  "type": "four-color",
  "adjacency": {
    "A": [
      "B",
      "C",
      "D"
    ],
    "B": [
      "A",
      "C",
      "E"
    ],
    "C": [
      "A",
      "B",
      "D",
      "E"
    ],
    "D": [
      "A",
      "C",
      "E"
    ],
    "E": [
      "B",
      "C",
      "D"
    ]
  },
  "nodes": [
    "A",
    "B",
    "C",
    "D",
    "E"
  ],
  "target": "E",
  "hint": "Assign colors greedily: for each node, pick the smallest color not used by its neighbors. What color is node E?",
  "answer_format": "color label (e.g., 'c2') for the target node"
}

author's note: Pool fill: four-color diff 4