Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling. It is also of significant theoretical interest and a standard subject in university-level courses on graph theory, algorithms, and combinatorics. In this paper, we consider the topics of node, edge, and face colouring along with their associated algorithms. Theoretical results are reviewed and brought to life through a collection of detailed, visually engaging figures designed to enhance understanding and appeal.