Arbitrarily vertex decomposable caterpillars with four or five leaves. - Sylwia Cichacz; Agnieszka Görlich; Antoni Marczyk; Jakub Przybylo; Mariusz Wozniak (Discuss. Math. Graph Theory, 2006)

Irregular edge-colorings of sums of cycles of even lengths. - Sylwia Cichacz; Jakub Przybylo; Mariusz Wozniak (Australas. J Comb., 2008)

Irregularity Strength of Regular Graphs. - Jakub Przybylo (Electron. J. Comb., 2008)

A Note on Neighbour-Distinguishing Regular Graphs Total-Weighting. - Jakub Przybylo (Electron. J. Comb., 2008)

A new upper bound for the total vertex irregularity strength of graphs. - Marcin Anholcer; Maciej Kalkowski; Jakub Przybylo (Discret. Math., 2009)

Decompositions of pseudographs into closed trails of even sizes. - Sylwia Cichacz; Jakub Przybylo; Mariusz Wozniak (Discret. Math., 2009)

Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs. - Jakub Przybylo (SIAM J. Discret. Math., 2009)

Vertex-distinquishing edge-colorings of linear forests. - Sylwia Cichacz; Jakub Przybylo (Discuss. Math. Graph Theory, 2010)

On a 1, 2 Conjecture. - Jakub Przybylo; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2010)

Total Weight Choosability of Graphs. - Jakub Przybylo; Mariusz Wozniak (Electron. J. Comb., 2011)

Irregular edge coloring of 2-regular graphs. - Sylwia Cichacz; Jakub Przybylo (Discret. Math. Theor. Comput. Sci., 2011)

Nonrepetitive list colourings of paths. - Jaroslaw Grytczuk; Jakub Przybylo; Xuding Zhu (Random Struct. Algorithms, 2011)

Seifert graphs and the braid index of classical and singular links. - Leonid Plachta; Jakub Przybylo; Mariusz Wozniak (Discret. Math., 2012)

On minimal arbitrarily partitionable graphs. - Olivier Baudon; Jakub Przybylo; Mariusz Wozniak (Inf. Process. Lett., 2012)

Can Colour-Blind Distinguish Colour Palettes? - Rafal Kalinowski; Monika Pilsniak; Jakub Przybylo; Mariusz Wozniak (Electron. J. Comb., 2013)

On upper bounds for multiple domination numbers of graphs. - Jakub Przybylo (Discret. Appl. Math., 2013)

Distant irregularity strength of graphs. - Jakub Przybylo (Discret. Math., 2013)

Rainbow connection in sparse graphs. - Arnfried Kemnitz; Jakub Przybylo; Ingo Schiermeyer; Mariusz Wozniak (Discuss. Math. Graph Theory, 2013)

Neighbor Sum Distinguishing Index. - Evelyne Flandrin; Antoni Marczyk; Jakub Przybylo; Jean-François Saclé; Mariusz Wozniak (Graphs Comb., 2013)

Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz. - Jakub Przybylo (SIAM J. Discret. Math., 2013)

Colour-blind Can Distinguish Colour Pallets. - Jakub Przybylo (Electron. J. Comb., 2014)

On the neighbour sum distinguishing index of planar graphs. - Marthe Bonamy; Jakub Przybylo (CoRR, 2014)

On the structure of arbitrarily partitionable graphs with given connectivity. - Olivier Baudon; Florent Foucaud; Jakub Przybylo; Mariusz Wozniak (Discret. Appl. Math., 2014)

On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. - Olivier Baudon; Julien Bensmail; Rafal Kalinowski; Antoni Marczyk; Jakub Przybylo; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2014)

How to personalize the vertices of a graph? - Rafal Kalinowski; Monika Pilsniak; Jakub Przybylo; Mariusz Wozniak (Eur. J. Comb., 2014)

On colour-blind distinguishing colour pallets in regular graphs. - Jakub Przybylo (J. Comb. Optim., 2014)

Total Vertex Irregularity Strength of Dense Graphs. - Piotr Majerski; Jakub Przybylo (J. Graph Theory, 2014)

On the Facial Thue Choice Index via Entropy Compression. - Jakub Przybylo (J. Graph Theory, 2014)

On the Irregularity Strength of Dense Graphs. - Piotr Majerski; Jakub Przybylo (SIAM J. Discret. Math., 2014)

Partitioning powers of traceable or hamiltonian graphs. - Olivier Baudon; Julien Bensmail; Jakub Przybylo; Mariusz Wozniak (Theor. Comput. Sci., 2014)

On decomposing regular graphs into locally irregular subgraphs. - Olivier Baudon; Julien Bensmail; Jakub Przybylo; Mariusz Wozniak (Eur. J. Comb., 2015)

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited. - Jakub Przybylo; Tsai-Lien Wong (J. Graph Theory, 2015)

Asymptotically optimal neighbour sum distinguishing colourings of graphs. - Jakub Przybylo (Random Struct. Algorithms, 2015)

On Decomposing Graphs of Large Minimum Degree into Locally Irregular Subgraphs. - Jakub Przybylo (Electron. J. Comb., 2016)

Distant Set Distinguishing Total Colourings of Graphs. - Jakub Przybylo (Electron. J. Comb., 2016)

A note on adjacent vertex distinguishing colorings of graphs. - Maria Axenovich; Jochen Harant; Jakub Przybylo; Roman Soták; Margit Voigt; Jenny Weidelich (Discret. Appl. Math., 2016)

Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz. - Jakub Przybylo (Discret. Appl. Math., 2016)

On an extremal problem in the class of bipartite 1-planar graphs. - Július Czap; Jakub Przybylo; Erika Skrabul'áková (Discuss. Math. Graph Theory, 2016)

On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method. - Jakub Przybylo; Jens Schreyer; Erika Skrabul'áková (Graphs Comb., 2016)

On a directed variation of the 1-2-3 and 1-2 Conjectures. - Emma Barme; Julien Bensmail; Jakub Przybylo; Mariusz Wozniak (Discret. Appl. Math., 2017)

Equitable neighbour-sum-distinguishing edge and total colourings. - Olivier Baudon; Monika Pilsniak; Jakub Przybylo; Mohammed Senhaji; Éric Sopena; Mariusz Wozniak (Discret. Appl. Math., 2017)

Distant irregularity strength of graphs with bounded minimum degree. - Jakub Przybylo (Discret. Appl. Math., 2017)

On weight choosabilities of graphs with bounded maximum average degree. - Jakub Przybylo; André Raspaud; Mariusz Wozniak (Discret. Appl. Math., 2017)

The neighbour-sum-distinguishing edge-colouring game. - Olivier Baudon; Jakub Przybylo; Mohammed Senhaji; Elzbieta Sidorowicz; Éric Sopena; Mariusz Wozniak (Discret. Math., 2017)

Asymptotically optimal neighbor sum distinguishing total colorings of graphs. - Sarah Loeb; Jakub Przybylo; Yunfang Tang (Discret. Math., 2017)

Distant sum distinguishing index of graphs. - Jakub Przybylo (Discret. Math., 2017)

On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree. - Hervé Hocquard; Jakub Przybylo (Graphs Comb., 2017)

On the Neighbor Sum Distinguishing Index of Planar Graphs. - Marthe Bonamy; Jakub Przybylo (J. Graph Theory, 2017)

A note on a directed version of the 1-2-3 Conjecture. - Mirko Hornák; Jakub Przybylo; Mariusz Wozniak (Discret. Appl. Math., 2018)

Distant total irregularity strength of graphs via random vertex ordering. - Jakub Przybylo (Discret. Math., 2018)

On locally irregular decompositions and the 1-2 Conjecture in digraphs. - Olivier Baudon; Julien Bensmail; Jakub Przybylo; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2018)

Group twin coloring of graphs. - Sylwia Cichacz; Jakub Przybylo (Discret. Math. Theor. Comput. Sci., 2018)

Distant set distinguishing edge colourings of graphs. - Jakub Przybylo (Eur. J. Comb., 2018)

New bounds for locally irregular chromatic index of bipartite and subcubic graphs. - Borut Luzar; Jakub Przybylo; Roman Soták (J. Comb. Optim., 2018)

Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs. - Marcin Anholcer; Sylwia Cichacz; Jakub Przybylo (Appl. Math. Comput., 2019)

Distant sum distinguishing index of graphs with bounded minimum degree. - Jakub Przybylo (Ars Math. Contemp., 2019)

Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture. - Julien Bensmail; Jakub Przybylo (Discret. Appl. Math., 2019)

A note on the weak (2, 2)-Conjecture. - Jakub Przybylo (Discret. Math., 2019)

Distant total sum distinguishing index of graphs. - Jakub Przybylo (Discret. Math., 2019)

A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. - Olivier Baudon; Julien Bensmail; Tom Davot; Hervé Hocquard; Jakub Przybylo; Mohammed Senhaji; Éric Sopena; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2019)

A note on asymptotically optimal neighbour sum distinguishing colourings. - Jakub Przybylo (Eur. J. Comb., 2019)

Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number. - Jakub Kwasny; Jakub Przybylo (Random Struct. Algorithms, 2019)

On a total version of 1-2-3 Conjecture. - Olivier Baudon; Hervé Hocquard; Antoni Marczyk; Monika Pilsniak; Jakub Przybylo; Mariusz Wozniak (Discuss. Math. Graph Theory, 2020)

On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. - Hervé Hocquard; Jakub Przybylo (J. Comb. Optim., 2020)

Largest Component and Node Fault Tolerance for Grids. - Jakub Przybylo; Andrzej Zak (Electron. J. Comb., 2021)

On the Standard (2, 2)-Conjecture. - Jakub Przybylo (Eur. J. Comb., 2021)

The 1-2-3 Conjecture almost holds for regular graphs. - Jakub Przybylo (J. Comb. Theory B, 2021)

On the inclusion chromatic index of a graph. - Jakub Przybylo; Jakub Kwasny (J. Graph Theory, 2021)

Conflict-free chromatic number versus conflict-free chromatic index. - Michal Debski; Jakub Przybylo (J. Graph Theory, 2022)

Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees. - Jakub Przybylo (J. Graph Theory, 2022)

A generalization of Faudree-Lehel conjecture holds almost surely for random graphs. - Jakub Przybylo (Random Struct. Algorithms, 2022)

The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree. - Jakub Przybylo (Comb., 2022)

Short Proof of the Asymptotic Confirmation of the Faudree-Lehel Conjecture. - Jakub Przybylo; Fan Wei (Electron. J. Comb., 2023)

On the Asymptotic Confirmation of the Faudree-Lehel Conjecture for General Graphs. - Jakub Przybylo; Fan Wei (Comb., 2023)

First-Fit Coloring of Forests in Random Arrival Model. - Bartlomiej Bosek; Grzegorz Gutowski; Michal Lason; Jakub Przybylo (MFCS, 2024)

A note on decomposing graphs to locally almost irregular subgraphs. - Jakub Przybylo (Appl. Math. Comput., 2024)

Decomposability of regular graphs to 4 locally irregular subgraphs. - Jakub Przybylo (Appl. Math. Comput., 2024)

On Generalised Majority Edge-Colourings of Graphs. - Pawel Pekala; Jakub Przybylo (Electron. J. Comb., 2024)

Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment. - Jakub Przybylo (Eur. J. Comb., 2024)

Inclusion chromatic index of random graphs. - Jakub Kwasny; Jakub Przybylo (J. Graph Theory, 2024)

On conflict-free proper colourings of graphs without small degree vertices. - Mateusz Kamyczura; Jakub Przybylo (Discret. Math., 2024)

On triangle-free list assignments. - Jakub Przybylo (Discret. Math., 2024)

A note on the conflict-free chromatic index. - Mateusz Kamyczura; Mariusz Meszka; Jakub Przybylo (Discret. Math., 2024)

Mrs. Correct and majority colorings. - Marcin Anholcer; Bartlomiej Bosek; Jaroslaw Grytczuk; Grzegorz Gutowski; Jakub Przybylo; Mariusz Zajac (Discret. Math., 2025)

Degree-balanced decompositions of cubic graphs. - Borut Luzar; Jakub Przybylo; Roman Soták (Eur. J. Comb., 2025)

The irregularity strength of dense graphs - on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel. - Jakub Przybylo (Eur. J. Comb., 2025)

Alon-Tarsi for hypergraphs. - Marcin Anholcer; Bartlomiej Bosek; Grzegorz Gutowski; Michal Lason; Jakub Przybylo; Oriol Serra; Michal Tuczynski; Lluís Vena; Mariusz Zajac (CoRR, 2025)