A coloring of a graph is an assignment of a color to each node of the graph in such a
Chapter 6, Problem 80(choose chapter or problem)
A coloring of a graph is an assignment of a color to each node of the graph in such a way that no two adjacent nodes have the same color. The chromatic number of a graph is the smallest number of colors needed to achieve a coloring. Find the chromatic number of the following graphs.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer