**Sheet H: Graph Coloring**

Prepared by:

Joseph Malkevitch

Department of Mathematics and Computer Studies

York College (CUNY)

Jamaica, New York

email:

__malkevitch@york.cuny.edu__

web page:

__http://york.cuny.edu/~malk__

1. For each of the graphs below find the minimum number of colors to color the vertices, faces (if possible - if the graph is not plane one can't color its faces), and edges of the graph shown. Also determine if the graph is 2-connected or 3-connected

a. G:

b. H:

c. I:

d. J:

e. K:

f. L