3.3. Conclusion

Try these first

1. 1.

   What is vertex colouring?

   Hint

   Focus on adjacent vertices.

2. 2.

   Can you define edge chromatic number?

   Hint

   Think about edges sharing vertices.

3. 3.

   What is the minimum number of colours required in a graph with 8 vertices where the maximum degree is 3?

   • 3
   • 4
   • 5

   Hint

   Think about the maximum degree.

4. 4.

   Vertex chromatic number is denoted by which symbol?

   Hint

   It's a Greek letter.

5. 5.

   Given a graph with 10 vertices where the maximum degree is 5, explain the implications for edge chromatic number. How would you utilize Δ(G)?

   Hint

   Examine the implications based on vertex edges.

6. 6.

   Illustrate a scenario in real life where graph colouring is applied and how you would determine chromatic numbers.

   Hint

   Think about how to model overlaps as connections in a graph.