Przybyło, Jakub; Wei, Fan Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture. (English) Zbl 07806254 Electron. J. Comb. 30, No. 4, Research Paper P4.27, 13 p. (2023). MSC: 05C22 05C15 05C78 PDFBibTeX XMLCite \textit{J. Przybyło} and \textit{F. Wei}, Electron. J. Comb. 30, No. 4, Research Paper P4.27, 13 p. (2023; Zbl 07806254) Full Text: DOI arXiv
Przybyło, Jakub A generalization of Faudree-Lehel conjecture holds almost surely for random graphs. (English) Zbl 1522.05444 Random Struct. Algorithms 61, No. 2, 383-396 (2022). MSC: 05C80 PDFBibTeX XMLCite \textit{J. Przybyło}, Random Struct. Algorithms 61, No. 2, 383--396 (2022; Zbl 1522.05444) Full Text: DOI
Przybyło, Jakub Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees. (English) Zbl 1522.05406 J. Graph Theory 100, No. 1, 189-204 (2022). MSC: 05C78 PDFBibTeX XMLCite \textit{J. Przybyło}, J. Graph Theory 100, No. 1, 189--204 (2022; Zbl 1522.05406) Full Text: DOI arXiv
Przybyło, Jakub The 1-2-3 conjecture almost holds for regular graphs. (English) Zbl 1458.05099 J. Comb. Theory, Ser. B 147, 183-200 (2021). MSC: 05C22 PDFBibTeX XMLCite \textit{J. Przybyło}, J. Comb. Theory, Ser. B 147, 183--200 (2021; Zbl 1458.05099) Full Text: DOI arXiv
Hocquard, Herve; Przybyło, Jakub On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. (English) Zbl 1434.05053 J. Comb. Optim. 39, No. 2, 412-424 (2020). MSC: 05C15 05C78 PDFBibTeX XMLCite \textit{H. Hocquard} and \textit{J. Przybyło}, J. Comb. Optim. 39, No. 2, 412--424 (2020; Zbl 1434.05053) Full Text: DOI arXiv
Przybyło, Jakub Distant sum distinguishing index of graphs with bounded minimum degree. (English) Zbl 1435.05084 Ars Math. Contemp. 17, No. 1, 37-49 (2019). MSC: 05C15 05C78 05C12 05C07 PDFBibTeX XMLCite \textit{J. Przybyło}, Ars Math. Contemp. 17, No. 1, 37--49 (2019; Zbl 1435.05084) Full Text: DOI arXiv
Bensmail, Julien; Przybyło, Jakub Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture. (English) Zbl 1419.05096 Discrete Appl. Math. 268, 1-9 (2019). MSC: 05C22 05C70 PDFBibTeX XMLCite \textit{J. Bensmail} and \textit{J. Przybyło}, Discrete Appl. Math. 268, 1--9 (2019; Zbl 1419.05096) Full Text: DOI arXiv
Przybyło, Jakub A note on asymptotically optimal neighbour sum distinguishing colourings. (English) Zbl 1404.05057 Eur. J. Comb. 77, 49-56 (2019). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Przybyło}, Eur. J. Comb. 77, 49--56 (2019; Zbl 1404.05057) Full Text: DOI arXiv
Przybyło, Jakub Distant total sum distinguishing index of graphs. (English) Zbl 1403.05051 Discrete Math. 342, No. 3, 683-688 (2019). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Przybyło}, Discrete Math. 342, No. 3, 683--688 (2019; Zbl 1403.05051) Full Text: DOI arXiv
Przybyło, Jakub A note on the weak \((2,2)\)-conjecture. (English) Zbl 1400.05186 Discrete Math. 342, No. 2, 498-504 (2019). MSC: 05C70 PDFBibTeX XMLCite \textit{J. Przybyło}, Discrete Math. 342, No. 2, 498--504 (2019; Zbl 1400.05186) Full Text: DOI
Przybyło, Jakub Distant total irregularity strength of graphs via random vertex ordering. (English) Zbl 1380.05080 Discrete Math. 341, No. 4, 1098-1102 (2018). MSC: 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{J. Przybyło}, Discrete Math. 341, No. 4, 1098--1102 (2018; Zbl 1380.05080) Full Text: DOI arXiv
Przybyło, Jakub Distant set distinguishing edge colourings of graphs. (English) Zbl 1376.05060 Eur. J. Comb. 69, 185-199 (2018). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Przybyło}, Eur. J. Comb. 69, 185--199 (2018; Zbl 1376.05060) Full Text: DOI arXiv
Hocquard, H.; Przybyło, J. On the neighbour sum distinguishing index of graphs with bounded maximum average degree. (English) Zbl 1380.05064 Graphs Comb. 33, No. 6, 1459-1471 (2017). MSC: 05C15 05C78 05C35 PDFBibTeX XMLCite \textit{H. Hocquard} and \textit{J. Przybyło}, Graphs Comb. 33, No. 6, 1459--1471 (2017; Zbl 1380.05064) Full Text: DOI arXiv
Przybyło, Jakub Distant irregularity strength of graphs with bounded minimum degree. (English) Zbl 1372.05043 Discrete Appl. Math. 233, 159-165 (2017). MSC: 05C07 05C35 05C15 PDFBibTeX XMLCite \textit{J. Przybyło}, Discrete Appl. Math. 233, 159--165 (2017; Zbl 1372.05043) Full Text: DOI arXiv
Bonamy, M.; Przybyło, J. On the neighbor sum distinguishing index of planar graphs. (English) Zbl 1367.05066 J. Graph Theory 85, No. 3, 669-690 (2017). MSC: 05C15 05C10 05C07 PDFBibTeX XMLCite \textit{M. Bonamy} and \textit{J. Przybyło}, J. Graph Theory 85, No. 3, 669--690 (2017; Zbl 1367.05066) Full Text: DOI arXiv
Przybyło, Jakub Distant sum distinguishing index of graphs. (English) Zbl 1367.05057 Discrete Math. 340, No. 10, 2402-2407 (2017). MSC: 05C12 05C15 PDFBibTeX XMLCite \textit{J. Przybyło}, Discrete Math. 340, No. 10, 2402--2407 (2017; Zbl 1367.05057) Full Text: DOI arXiv
Przybyło, Jakub; Raspaud, André; Woźniak, Mariusz On weight choosabilities of graphs with bounded maximum average degree. (English) Zbl 1358.05165 Discrete Appl. Math. 217, Part 3, 663-672 (2017). MSC: 05C40 05C15 PDFBibTeX XMLCite \textit{J. Przybyło} et al., Discrete Appl. Math. 217, Part 3, 663--672 (2017; Zbl 1358.05165) Full Text: DOI
Loeb, Sarah; Przybyło, Jakub; Tang, Yunfang Asymptotically optimal neighbor sum distinguishing total colorings of graphs. (English) Zbl 1351.05083 Discrete Math. 340, No. 2, 58-62 (2017). MSC: 05C15 PDFBibTeX XMLCite \textit{S. Loeb} et al., Discrete Math. 340, No. 2, 58--62 (2017; Zbl 1351.05083) Full Text: DOI arXiv
Przybyło, Jakub Distant set distinguishing total colourings of graphs. (English) Zbl 1339.05147 Electron. J. Comb. 23, No. 2, Research Paper P2.54, 20 p. (2016). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Przybyło}, Electron. J. Comb. 23, No. 2, Research Paper P2.54, 20 p. (2016; Zbl 1339.05147) Full Text: arXiv Link
Przybyło, Jakub Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz. (English) Zbl 1330.05074 Discrete Appl. Math. 202, 163-173 (2016). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Przybyło}, Discrete Appl. Math. 202, 163--173 (2016; Zbl 1330.05074) Full Text: DOI
Przybyło, Jakub; Wong, Tsai-Lien Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited. (English) Zbl 1330.05075 J. Graph Theory 80, No. 4, 299-312 (2015). MSC: 05C15 05C78 05C10 PDFBibTeX XMLCite \textit{J. Przybyło} and \textit{T.-L. Wong}, J. Graph Theory 80, No. 4, 299--312 (2015; Zbl 1330.05075) Full Text: DOI
Przybyło, Jakub Asymptotically optimal neighbour sum distinguishing colourings of graphs. (English) Zbl 1331.05083 Random Struct. Algorithms 47, No. 4, 776-791 (2015). Reviewer: Eric Sopena (Talence) MSC: 05C15 PDFBibTeX XMLCite \textit{J. Przybyło}, Random Struct. Algorithms 47, No. 4, 776--791 (2015; Zbl 1331.05083) Full Text: DOI arXiv
Baudon, O.; Bensmail, J.; Przybyło, J.; Woźniak, M. On decomposing regular graphs into locally irregular subgraphs. (English) Zbl 1315.05105 Eur. J. Comb. 49, 90-104 (2015). MSC: 05C70 PDFBibTeX XMLCite \textit{O. Baudon} et al., Eur. J. Comb. 49, 90--104 (2015; Zbl 1315.05105) Full Text: DOI