Can you provide an example of a graph coloring problem along with its solution?

One example of a graph coloring problem is the map coloring problem, where you have a map of regions that need to be colored in such a way that no two adjacent regions share the same color.

For instance, consider a map with four regions: A, B, C, and D. If A and B are adjacent, they cannot be the same color. One possible solution could be to color region A red, region B blue, region C green, and region D yellow. This way, no adjacent regions share the same color, satisfying the graph coloring constraint.