Advanced
Graph Coloring Complexity
Explore the theoretical complexity of the k-Coloring problem.
📝 프롬프트 내용
Define the decision version of the Graph k-Coloring problem. Provide a theoretical explanation for why the 3-Coloring problem is NP-complete by reducing it from the 3-SAT problem or 3-Vertex Cover.