Author

Tuomo Lehtilä

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth

This work focuses on graphs of bounded treewidth and pathwidth, and provides constructions that reach these bounds, and has the tight bound $nc(G,k))\leq \frac{7}{3}k$, for graphs $G$ with pathwidth 1 or treewidth 1.

Gaétan Berthe, F. Foucaud, Tuomo Lehtilä et al. · arXiv.org · 0 citations