Tuomo Lehtilä

activity

20212026

most citedNeighbourhood complexity of graphs of bounded twin-width

7 citations · 18 across the 14 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

cs.DM2022★ 1 cited

The RED-BLUE SEPARATION problem on graphs

Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud +2

We introduce the Red-Blue Separation problem on graphs, where we are given a graph $G = (V, E)$ whose vertices are colored either red or blue, and we want to select a (small) subset $…

math.CO2022★ 3 cited

Bounds and extremal graphs for total dominating identifying codes

Florent Foucaud, Tuomo Lehtilä

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$ . The smallest size of an…

math.CO2022★ 6 cited

Revisiting and improving upper bounds for identifying codes

Florent Foucaud, Tuomo Lehtilä

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$ . These codes have been w…