Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...

Edge colouring is a fundamental concept in graph theory whereby colours are assigned to the edges of a graph such that no two adjacent edges share the same colour. This process is central to numerous ...

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

Let’s say you’re planning your next party and agonizing over the guest list. To whom should you send invitations? What combination of friends and strangers is the right mix? It turns out ...

The so-called differential equation method in probabilistic combinatorics presented by Patrick Bennett, Ph.D., Department of Mathematics, Western Michigan University Abstract: Differential equations ...

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