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

Abstract We calculate the intersection ring of 3-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold’s underlying graph is a ...

Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...