Jakub Przybyło

On the Irregularity Strength of Dense Graphs

Consider a graph

Nonrepetitive list colourings of paths

G=(V,E)

Arbitrarily vertex decomposable caterpillars with four or five leaves

of minimum degree

Total Vertex Irregularity Strength of Dense Graphs

\delta

Rainbow Connection In Sparse Graphs

and order

Distant irregularity strength of graphs

n

On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method

. Its irregularity strength is the smallest integer

A note on adjacent vertex distinguishing colorings of graphs

k

New bounds for locally irregular chromatic index of bipartite and subcubic graphs

for which one can find a weighting

Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz

w:E\to \{1,2,\ldots,k\}