24 citations · 120 across the 33 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
math.CO2024
On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
Mateusz Kamyczura, Jakub Przybyło
Let be a graph of maximum degree which does not contain isolated vertices. An edge coloring of is called conflict-free if each edge's closed neighborhood includes a…
math.CO2024★ 1 cited
The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
Jakub Przybyło
The irregularity strength of a graph , , is the least such that there exists a -weighting of the edges of attributing distinct weighted degrees t…
math.CO2024
Decomposability of regular graphs to locally irregular subgraphs
Jakub Przybyło
A locally irregular graph is a graph whose adjacent vertices have distinct degrees. It was conjectured that every connected graph is edge decomposable to locally irregular subg…