Question: 1. Find the chromatic number of the graph shown in Figure.
2. Find the chromatic index of the graph shown in Figure.
3. For G as shown in Figure, use a greedy algorithm to color the edges. Does it give an optimal coloring? If not, then use color switching along paths or trees to improve the coloring.
![2433_50.jpg](https://secure.tutorsglobe.com/CMSImages/2433_50.jpg)