Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...

Antimagic labelling is a fascinating area of graph theory that assigns unique integers to the edges of a graph in such a way that the resulting vertex sums are distinct. This concept, grounded in the ...

For those who hear the phrase “graph theory” and think of the basic pie charts and bar graphs introduced in elementary school, there’s a new world to be explored. “In graph theory, the most simple way ...

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