Kenny Štorgel

activity

20242026

collaborators

5 papers

math.CO2026

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

Kenny BeÅ¡ter Å torgel, Kenny Bešter Štorgel, Nina Chiarelli +7

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…

math.CO2025

Awesome graph parameters

Kenny BeÅ¡ter Å torgel, ClÃ©ment Dallard, Vadim Lozin +2

For a graph $G$ , we denote by $I^\pm (G)$ the size of a maximum independent set and by $I ¨ (G)$ the size of a maximum clique in $G$ . Our paper lies on the edge of two lines of research,…

cs.DS2024

Tree decompositions meet induced matchings: beyond Max Weight Independent Set

Paloma T. Lima, Martin MilaniÄ, Peter MurÅ¡iÄ +3

For a tree decomposition $T$ of a graph $G$ , by $I^¼ (T)$ we denote the size of a largest induced matching in $G$ all of whose edges intersect one bag of $\mathca…

math.CO2024

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star

Many recent works address the question of characterizing induced obstructions to bounded treewidth. In 2022, Lozin and Razgon completely answered this question for graph classes de…

math.CO2024

Twin-width of graphs on surfaces

Daniel KrÃ¡Ä¾, KristÃ½na PekÃ¡rkovÃ¡, Kenny Å torgel

Twin-width is a width parameter introduced by Bonnet, Kim, ThomassÃ© and Watrigant [FOCS'20, JACM'22], which has many structural and algorithmic applications. We prove that the twi…