Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...

Fibonacci cubes represent a fascinating class of graphs that emerge as subgraphs of the n-dimensional hypercube. Defined by the restriction to binary strings that avoid consecutive 1s, these graphs ...

A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections. “It’s a bit of a surprise, at least for me, that such a combination ...