Graph colouring and irregularity strength represent two complementary strands of graph-labelling theory with deep roots in combinatorial optimisation and practical implications for network design, ...