What is the problem formulation for coloring a planar map using only four colors in such a way that no two adjacent regions have the same color?

A) Graph coloring problem
B) Traveling salesman problem
C) Knapsack problem
D) Linear programming problem

Q&A Education