b) What is the chromatic number for each of the graphs? ( the chromatic number of a graph is the minimum number of colors needed to color the graph)

c) If the number of colors obtained in either case a) or case b) by using procedure GREEDY that results in the number of colors which is greater than the chromatic number of the graph. Check if the change in the order of vertices of the graph result in the minimum number of colors needed to color the graph. If it does, provide that order.

CISC4080 COMPUTER ALGORITHMS Homework 1 Use the procedure GREEDY as presented in the class to obtain the number of colors needed to color the following two graphs. U5 02 06 01 04 U3 01 U5 U4 U3 02 v7 06 U8