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 2021Show all

3 papers · 1 filter

math.CO2021★ 2 cited

Treewidth versus clique number. II. Tree-independence number

Clément Dallard, Martin Milanič, Kenny Štorgel

In 2020, we initiated a systematic study of graph classes in which the treewidth can only be large due to the presence of a large clique, which we call $(tw, ω)$ -bounded. W…

math.CO2021

Further Extensions of the Grötzsch Theorem

Hoang La, Borut Lužar, Kenny Štorgel

The Grötzsch Theorem states that every triangle-free planar graph admits a proper $3$ -coloring. Among many of its generalizations, the one of Grünbaum and Aksenov, giving $3$ -color…

math.CO2021★ 1 cited

3-facial edge-coloring of plane graphs

Mirko Horňák, Borut Lužar, Kenny Štorgel

An $ℓ$ -facial edge-coloring of a plane graph is a coloring of its edges such that any two edges at distance at most $ℓ$ on a boundary walk of any face receive distinct colors…