1. Find the chromatic number of the graph shown in Figure 13.24.
2. Find the chromatic index of the graph shown in Figure 13.24.
3. For G as shown in Figure 13.24, 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.
![552_670825d1-c49f-440c-93ab-98784b992b42.png](https://secure.tutorsglobe.com/CMSImages/552_670825d1-c49f-440c-93ab-98784b992b42.png)