Justyna Jaworska

collaborators

2 papers

cs.CC2025

Constricting the Computational Complexity Gap of the $4$ -Coloring Problem in $(P_{t}, C_{3})$ -free Graphs

Justyna Jaworska, Bartłomiej Kielak, Tomáš Masařík +1

The $k$ -Coloring problem on hereditary graph classes has been a deeply researched problem over the last decade. A hereditary graph class is characterized by a (possibly infinite) l…

math.CO2025

Generalized Turán problem for directed cycles

Andrzej Grzesik, Justyna Jaworska, Bartłomiej Kielak +2

For integers $k, ℓ \geq 3$ , let $ex (n, C_{k}, C_{ℓ})$ denote the maximum number of directed cycles of length $k$ in any oriented graph…

Constricting the Computational Complexity Gap of the 4-Coloring Problem in (Pt​,C3​)-free Graphs

Generalized Turán problem for directed cycles

Constricting the Computational Complexity Gap of the $4$ -Coloring Problem in $(P_{t}, C_{3})$ -free Graphs