Jakub Kwaśny

most citedAsymptotically optimal bound on the adjacent vertex distinguishing edge choice number

6 citations · 8 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2019★ 2 cited

On inclusion chromatic index of a graph

Jakub Kwaśny, Jakub Przybyło

Let $χ_{\subset}^{'} (G)$ be the least number of colours necessary to properly colour the edges of a graph $G$ with minimum degree $δ \geq 2$ so that the set of colours incident with any…

math.CO2017★ 6 cited

Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number

Jakub Kwaśny, Jakub Przybyło

An adjacent vertex distinguishing edge colouring of a graph $G$ without isolated edges is its proper edge colouring such that no pair of adjacent vertices meets the same set of col…