Coloring a graph

What is the fewest number of colors needed such that no two adjacent vertices are colored the same?

Note: In graph theory, two vertices are adjacent if they share an edge.

×

Problem Loading...

Note Loading...

Set Loading...