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

3 papers · 1 filter

math.CO2022★ 7 cited

Locally irregular edge-coloring of subcubic graphs

Borut Lužar, Mária Maceková, Simona Rindošová +3

A graph is {\em locally irregular} if no two adjacent vertices have the same degree. A {\em locally irregular edge-coloring} of a graph $G$ is such an (improper) edge-coloring that…

math.CO2022★ 1 cited

Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure

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

We continue the study of $(tw, ω)$ -bounded graph classes, that is, hereditary graph classes in which the treewidth can only be large due to the presence of a large clique,…

math.CO2022★ 1 cited

$2$ -distance, injective, and exact square list-coloring of planar graphs with maximum degree 4

Hoang La, Kenny Štorgel

In the past various distance based colorings on planar graphs were introduced. We turn our focus to three of them, namely $2$ -distance coloring, injective coloring, and exact squar…

Locally irregular edge-coloring of subcubic graphs

Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure

2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4

$2$ -distance, injective, and exact square list-coloring of planar graphs with maximum degree 4