J. Przybylo

activity

20122024

most citedOn the facial Thue choice index via entropy compression

24 citations · 120 across the 33 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2017

Equitable neighbour-sum-distinguishing edge and total colourings

Olivier Baudon, Monika Pilsniak, Jakub Przybylo +3

With any (not necessarily proper) edge $k$ -colouring $γ : E (G) ⟶ {1, \dots, k}$ of a graph $G$ ,one can associate a vertex colouring $σ_γ$ given by $σ\_γ(v)=\sum\_{e\ni v…

cs.DM2014★ 23 cited

On the neighbour sum distinguishing index of planar graphs

Marthe Bonamy, Jakub Przybyło

Let $c$ be a proper edge colouring of a graph $G = (V, E)$ with integers $1, 2, \dots, k$ . Then $k \geq Δ (G)$ , while by Vizing's theorem, no more than $k = Δ (G) + 1$ is necessary for constru…