24 citations · 120 across the 33 of their papers we have counts for
4 papers · 1 filter
The 1-2-3 Conjecture almost holds for regular graphs
Jakub Przybyło
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with , and so that adjacent vertices receive distinct weight…
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
Marcin Anholcer, Sylwia Cichacz, Jakub Przybyło
We investigate the \textit{group irregularity strength}, , of a graph, i.e. the least integer such that taking any Abelian group of order , there exist…
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture
Julien Bensmail, Jakub Przybyło
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with , and so that adjacent vertices receive distinct weight…
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
Hervé Hocquard, Jakub Przybyło
A proper total -colouring of a graph is an assignment of colours to the edges and the vertices of such that no two adjacent edge…