The main objective of work package 3 is to improve the understanding of the transition between discrete and continuum nonlocal models, which are investigated as part of the first two main objectives ...

Graph decomposition encompasses a suite of methods by which the edges of a graph are partitioned into subgraphs that satisfy prescribed properties or isomorphism classes. Central to this field are ...

Graph polynomials serve as powerful invariants that encode both combinatorial and topological features of graphs drawn on surfaces. Beginning with the classical Tutte polynomial for planar graphs, ...