Kenny Štorgel

activity

20202025

most citedTreewidth versus clique number. I. Graph classes with a forbidden structure

11 citations · 27 across the 12 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Awesome graph parameters

Kenny Bešter Štorgel, Clément Dallard, Vadim Lozin +2

For a graph $G$ , we denote by $α (G)$ the size of a maximum independent set and by $ω (G)$ the size of a maximum clique in $G$ . Our paper lies on the edge of two lines of research, r…

math.CO2025

On ${k}$ -Roman graphs: complexity of recognition and the case of split graphs

Kenny Bešter Štorgel, Nina Chiarelli, Lara Fernández +4

For a positive integer $k$ , a ${k}$ -Roman dominating function of a graph $G = (V, E)$ is a function $f : V \to {0, 1, \dots, k}$ satisfying $\sum_{u\in N(v)} f(u) \geq…

Awesome graph parameters

On {k}-Roman graphs: complexity of recognition and the case of split graphs

On ${k}$ -Roman graphs: complexity of recognition and the case of split graphs