24 citations · 120 across the 33 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
Asymptotic confirmation of the Faudree-Lehel Conjecture on irregularity strength for all but extreme degrees
Jakub Przybyło
The irregularity strength of a graph , , is the least admitting a -weighting of the edges of assuring distinct weighted degrees of all vertices,…
math.CO2019★ 1 cited
On the Standard (2,2)-Conjecture
Jakub Przybyło
The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with , and so that adjacent vertices receive distinct weig…
math.CO2019★ 2 cited
On inclusion chromatic index of a graph
Jakub Kwaśny, Jakub Przybyło
Let be the least number of colours necessary to properly colour the edges of a graph with minimum degree so that the set of colours incident with any…