Find the chromatic number for the graph above by finding a valid graph colouring that uses the minimum number of colours, and then, once you have found this colouring, describe how you came to that number of colours. Provide the coloured graph you create.

2. Find the chromatic number for the graph above by finding a valid graph colouring that uses the minimum number of colours, and then, once you have found this colouring, describe how you came to that number of colours. Provide the coloured graph you create (4 marks) Use the following graph for 3 and 4 3. An Euler path is a path that uses every edge of a graph exactly once, that starts at one node and ends at a different node. An Euler cycle, is an Euler path that starts and ends at the same node. Does the following graph have an Euler path? Does it have an Euler cycle? If it does, then list the edges in the order they are crossed, and if it does not then explain why. [3 marks]