The theory of coloring deals with the problem of labeling parts of a graph to comply with certain rules and avoid specific conflicts. For example, imagine you wanted to color each dot below so that ...

Maria you are giving the annual Hamilton Lecture soon in Dublin, what will you talk about? I will talk about simple problems or puzzles that relate to parties, doughnuts and colouring and explain how ...

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

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

In the fall of 1972, Vance Faber was a new professor at the University of Colorado. When two influential mathematicians, Paul Erdős and László Lovász, came for a visit, Faber decided to host a tea ...