Graph homomorphisms and chromatic numbers are foundational concepts in modern graph theory, with widespread applications that extend from combinatorial optimisation to theoretical computer science.

Graph crossing numbers quantify the minimum number of edge intersections in any planar drawing of a graph, an essential parameter in both theoretical and applied graph theory.