Graph Coloring
A coloring of a simple graph is the assignment of a color to each
vertex of the graph so that no two adjacent vertices are assigned
the same color.
Below are two simple graphs. Color each of the graphs according to the
instructions. Make sure that in each situation any vertices that are connected are not
the same color.
Color each graph below with as many colors as you can.
 |
 |
| GRAPH 1 |
GRAPH 2 |
Now color each one in a different way.
|
|
| GRAPH 1 |
GRAPH 2 |
Finally try to color the graph with the least number of colors
possible.
|
|
| GRAPH 1 |
GRAPH 2 |