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

Let G be a locally finite infinite graph and let I(G) be the set of ends of G. The Freudenthal compactification of G is the topological space |G| which is obtained from the usual topological space of ...

In 1950 Edward Nelson, then a student at the University of Chicago, asked the kind of deceptively simple question that can give mathematicians fits for decades. Imagine, he said, a graph — a ...