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

Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

Abstractions blog A New Algorithm for Graph Crossings, Hiding in Plain Sight Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory ...

We report new empirical and theoretical information about the dimension of trophic-niche space and the structure of food webs, as measured by the frequency of intervality and triangulation of overlap ...