Krzysztof Wesek

activity

20152022

j

-fold colouring of the plane

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

collaborators

3 papers

math.CO2022

Coloring distance graphs on the plane

Joanna Chybowska-Sokół, Konstanty Junosza-Szaniawski, Krzysztof Węsek

We consider the coloring of certain distance graphs on the Euclidean plane. Namely, we ask for the minimal number of colors needed to color all points of the plane in such a way th…

math.CO2017★ 3 cited

On cordial labeling of hypertrees

Michał Tuczyński, Przemysław Wenus, Krzysztof Węsek

Let $f : V \to Z_{k}$ be a vertex labeling of a hypergraph $H = (V, E)$ . This labeling induces an~edge labeling of $H$ defined by $f (e) = \sum_{v \in e} f (v)$ , where the sum is…

math.CO2015★ 9 cited

Fractional and $j$ -fold colouring of the plane

Jarosław Grytczuk, Konstanty Junosza-Szaniawski, Joanna Sokół +1

We present results referring to the Hadwiger-Nelson problem which asks for the minimum number of colours needed to colour the plane with no two points at distance $1$ having the sa…

Coloring distance graphs on the plane

On cordial labeling of hypertrees

Fractional and j-fold colouring of the plane

Fractional and $j$ -fold colouring of the plane