activity
20182024
most citedThe treewidth and pathwidth of graph unions

2 citations · 3 across the 9 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

math.CO2024★ 1 cited

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions

Bogdan Alecu, Mamadou Moustapha Kanté, Vadim Lozin +1

Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear clique-width and they are w…