Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...

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, ...

In just three pages, a Russian mathematician has presented a better way to color certain types of networks than many experts thought possible. A paper posted online last month has disproved a ...

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...