COLORING OF GRAPHS 1. Dene chromatic number and chromatic index of a graph . 2.

Prove that for a graph (G) 1+(G),where the symbols have their usual meaning. 3. Write the chromatic number of (a) a cycle of length n. (b) a bipartite graph . (c) a totally disconnected graph. 4. Prove that every planer graph is ve colorable. 5. Write the chromatic polynomial of a complete graph of n vertices . 6. A graph G contains three components. One component contains a triangle,another contains a line jining two points.Another contains one isolated point.Find the chromatic polynomial of the graph G. 7. Prove that a chromatic polynomial can not contain a constant term which is not equal to 0. 8. For a k chromatic graph G if P(G,) denotes the chromatic polynomial,where is the number of colors available,nd P(G,k-1). 9. A k-chromatic graph is said to be critically k-chromatic if (G v)=k1 for every vertex v in G. Give an example of a critically k-chromatic graph. 10. Find the chromatic polynomial of a graph G with n vertices where n=3 or 4.