Jakub Przybylo

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 51

Top Topics

Connected Subgraphs

Top Venues

Discret. Appl. Math.

J. Graph Theory

Publications

Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo
First-Fit Coloring of Forests in Random Arrival Model. MFCS (2024)
Jakub Przybylo
On triangle-free list assignments. Discret. Math. 347 (2) (2024)
Jakub Przybylo
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment. Eur. J. Comb. 120 (2024)
Mateusz Kamyczura, Mariusz Meszka, Jakub Przybylo
A note on the conflict-free chromatic index. Discret. Math. 347 (4) (2024)
Mateusz Kamyczura, Jakub Przybylo
On conflict-free proper colourings of graphs without small degree vertices. Discret. Math. 347 (1) (2024)
Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo
First-Fit Coloring of Forests in Random Arrival Model. CoRR (2024)
Jakub Przybylo
Decomposability of regular graphs to 4 locally irregular subgraphs. Appl. Math. Comput. 480 (2024)
Jakub Przybylo
A note on decomposing graphs to locally almost irregular subgraphs. Appl. Math. Comput. 470 (2024)
Jakub Przybylo, Fan Wei
Short Proof of the Asymptotic Confirmation of the Faudree-Lehel Conjecture. Electron. J. Comb. 30 (4) (2023)
Jakub Przybylo, Fan Wei
On the Asymptotic Confirmation of the Faudree-Lehel Conjecture for General Graphs. Comb. 43 (4) (2023)
Jakub Przybylo
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree. Comb. 42 (Supplement 2) (2022)
Michal Debski, Jakub Przybylo
Conflict-free chromatic number versus conflict-free chromatic index. J. Graph Theory 99 (3) (2022)
Jakub Przybylo
A generalization of Faudree-Lehel conjecture holds almost surely for random graphs. Random Struct. Algorithms 61 (2) (2022)
Jakub Przybylo
Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees. J. Graph Theory 100 (1) (2022)
Jakub Przybylo, Andrzej Zak
Largest Component and Node Fault Tolerance for Grids. Electron. J. Comb. 28 (1) (2021)
Jakub Przybylo
The 1-2-3 Conjecture almost holds for regular graphs. J. Comb. Theory, Ser. B 147 (2021)
Jakub Przybylo
On the Standard (2, 2)-Conjecture. Eur. J. Comb. 94 (2021)
Jakub Przybylo, Jakub Kwasny
On the inclusion chromatic index of a graph. J. Graph Theory 97 (1) (2021)
Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory 40 (4) (2020)
Hervé Hocquard, Jakub Przybylo
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. J. Comb. Optim. 39 (2) (2020)
Jakub Przybylo
On the Standard (2, 2)-Conjecture. CoRR (2019)
Julien Bensmail, Jakub Przybylo
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture. Discret. Appl. Math. 268 (2019)
Jakub Kwasny, Jakub Przybylo
Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number. Random Struct. Algorithms 54 (4) (2019)
Marcin Anholcer, Sylwia Cichacz, Jakub Przybylo
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs. Appl. Math. Comput. 343 (2019)
Jakub Przybylo
A note on asymptotically optimal neighbour sum distinguishing colourings. Eur. J. Comb. 77 (2019)
Jakub Przybylo
A note on the weak (2, 2)-Conjecture. Discret. Math. 342 (2) (2019)
Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Jakub Przybylo
Distant sum distinguishing index of graphs with bounded minimum degree. Ars Math. Contemp. 17 (1) (2019)
Jakub Przybylo
Distant total sum distinguishing index of graphs. Discret. Math. 342 (3) (2019)
Mirko Hornák, Jakub Przybylo, Mariusz Wozniak
A note on a directed version of the 1-2-3 Conjecture. Discret. Appl. Math. 236 (2018)
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
On locally irregular decompositions and the 1-2 Conjecture in digraphs. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Jakub Przybylo
Distant total irregularity strength of graphs via random vertex ordering. Discret. Math. 341 (4) (2018)
Jakub Przybylo
Distant set distinguishing edge colourings of graphs. Eur. J. Comb. 69 (2018)
Sylwia Cichacz, Jakub Przybylo
Group twin coloring of graphs. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Borut Luzar, Jakub Przybylo, Roman Soták
New bounds for locally irregular chromatic index of bipartite and subcubic graphs. J. Comb. Optim. 36 (4) (2018)
Jakub Przybylo
Distant irregularity strength of graphs with bounded minimum degree. Discret. Appl. Math. 233 (2017)
Emma Barme, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
On a directed variation of the 1-2-3 and 1-2 Conjectures. Discret. Appl. Math. 217 (2017)
Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. 222 (2017)
Jakub Przybylo, André Raspaud, Mariusz Wozniak
On weight choosabilities of graphs with bounded maximum average degree. Discret. Appl. Math. 217 (2017)
Sarah Loeb, Jakub Przybylo, Yunfang Tang
Asymptotically optimal neighbor sum distinguishing total colorings of graphs. Discret. Math. 340 (2) (2017)
Hervé Hocquard, Jakub Przybylo
On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree. Graphs Comb. 33 (6) (2017)
Jakub Przybylo
Distant sum distinguishing index of graphs. Discret. Math. 340 (10) (2017)
Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak
The neighbour-sum-distinguishing edge-colouring game. Discret. Math. 340 (7) (2017)
Marthe Bonamy, Jakub Przybylo
On the Neighbor Sum Distinguishing Index of Planar Graphs. J. Graph Theory 85 (3) (2017)
Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
Equitable neighbour-sum-distinguishing edge and total colourings. CoRR (2017)
Jakub Przybylo
On Decomposing Graphs of Large Minimum Degree into Locally Irregular Subgraphs. Electron. J. Comb. 23 (2) (2016)
Július Czap, Jakub Przybylo, Erika Skrabul'áková
On an extremal problem in the class of bipartite 1-planar graphs. Discuss. Math. Graph Theory 36 (1) (2016)
Jakub Przybylo
Distant Set Distinguishing Total Colourings of Graphs. Electron. J. Comb. 23 (2) (2016)
Jakub Przybylo
Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz. Discret. Appl. Math. 202 (2016)
Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták, Margit Voigt, Jenny Weidelich
A note on adjacent vertex distinguishing colorings of graphs. Discret. Appl. Math. 205 (2016)
Jakub Przybylo, Jens Schreyer, Erika Skrabul'áková
On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method. Graphs Comb. 32 (3) (2016)
Jakub Przybylo
Asymptotically optimal neighbour sum distinguishing colourings of graphs. Random Struct. Algorithms 47 (4) (2015)
Jakub Przybylo, Tsai-Lien Wong
Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited. J. Graph Theory 80 (4) (2015)
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49 (2015)
Jakub Przybylo
On colour-blind distinguishing colour pallets in regular graphs. J. Comb. Optim. 28 (2) (2014)
Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Piotr Majerski, Jakub Przybylo
Total Vertex Irregularity Strength of Dense Graphs. J. Graph Theory 76 (1) (2014)
Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
Partitioning powers of traceable or hamiltonian graphs. Theor. Comput. Sci. 520 (2014)
Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak
On the structure of arbitrarily partitionable graphs with given connectivity. Discret. Appl. Math. 162 (2014)
Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
How to personalize the vertices of a graph? Eur. J. Comb. 40 (2014)
Jakub Przybylo
On the Facial Thue Choice Index via Entropy Compression. J. Graph Theory 77 (3) (2014)
Marthe Bonamy, Jakub Przybylo
On the neighbour sum distinguishing index of planar graphs. CoRR (2014)
Piotr Majerski, Jakub Przybylo
On the Irregularity Strength of Dense Graphs. SIAM J. Discret. Math. 28 (1) (2014)
Jakub Przybylo
Colour-blind Can Distinguish Colour Pallets. Electron. J. Comb. 21 (2) (2014)
Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak
Rainbow connection in sparse graphs. Discuss. Math. Graph Theory 33 (1) (2013)
Jakub Przybylo
Distant irregularity strength of graphs. Discret. Math. 313 (24) (2013)
Jakub Przybylo
On upper bounds for multiple domination numbers of graphs. Discret. Appl. Math. 161 (16-17) (2013)
Evelyne Flandrin, Antoni Marczyk, Jakub Przybylo, Jean-François Saclé, Mariusz Wozniak
Neighbor Sum Distinguishing Index. Graphs Comb. 29 (5) (2013)
Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
Can Colour-Blind Distinguish Colour Palettes? Electron. J. Comb. 20 (3) (2013)
Jakub Przybylo
Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz. SIAM J. Discret. Math. 27 (3) (2013)
Leonid Plachta, Jakub Przybylo, Mariusz Wozniak
Seifert graphs and the braid index of classical and singular links. Discret. Math. 312 (18) (2012)
Olivier Baudon, Jakub Przybylo, Mariusz Wozniak
On minimal arbitrarily partitionable graphs. Inf. Process. Lett. 112 (17-18) (2012)
Sylwia Cichacz, Jakub Przybylo
Irregular edge coloring of 2-regular graphs. Discret. Math. Theor. Comput. Sci. 13 (1) (2011)
Jakub Przybylo, Mariusz Wozniak
Total Weight Choosability of Graphs. Electron. J. Comb. 18 (1) (2011)
Jaroslaw Grytczuk, Jakub Przybylo, Xuding Zhu
Nonrepetitive list colourings of paths. Random Struct. Algorithms 38 (1-2) (2011)
Sylwia Cichacz, Jakub Przybylo
Vertex-distinquishing edge-colorings of linear forests. Discuss. Math. Graph Theory 30 (1) (2010)
Jakub Przybylo, Mariusz Wozniak
On a 1, 2 Conjecture. Discret. Math. Theor. Comput. Sci. 12 (1) (2010)
Sylwia Cichacz, Jakub Przybylo, Mariusz Wozniak
Decompositions of pseudographs into closed trails of even sizes. Discret. Math. 309 (15) (2009)
Marcin Anholcer, Maciej Kalkowski, Jakub Przybylo
A new upper bound for the total vertex irregularity strength of graphs. Discret. Math. 309 (21) (2009)
Jakub Przybylo
Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs. SIAM J. Discret. Math. 23 (1) (2009)
Jakub Przybylo
A Note on Neighbour-Distinguishing Regular Graphs Total-Weighting. Electron. J. Comb. 15 (1) (2008)
Jakub Przybylo
Irregularity Strength of Regular Graphs. Electron. J. Comb. 15 (1) (2008)
Sylwia Cichacz, Jakub Przybylo, Mariusz Wozniak
Irregular edge-colorings of sums of cycles of even lengths. Australas. J Comb. 40 (2008)
Sylwia Cichacz, Agnieszka Görlich, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak
Arbitrarily vertex decomposable caterpillars with four or five leaves. Discuss. Math. Graph Theory 26 (2) (2006)