Kenny Štorgel

activity

20232025

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

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

collaborators

Showing math.COShow all

5 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…

math.CO2024★ 2 cited

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

Clément Dallard, Matjaž Krnc, O-joung Kwon +4

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.CO2023

Packing coloring of hypercubes with extended Hamming codes

Petr Gregor, Jaka Kranjc, Borut Lužar +1

A {\em packing coloring} of a graph $G$ is a mapping assigning a positive integer (a color) to every vertex of $G$ such that every two vertices of color $k$ are at distance at leas…

math.CO2023

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 twin…