default search action
Jakub Przybylo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j79]Jakub Przybylo
:
A note on decomposing graphs to locally almost irregular subgraphs. Appl. Math. Comput. 470: 128584 (2024) - [j78]Jakub Przybylo
Decomposability of regular graphs to 4 locally irregular subgraphs. Appl. Math. Comput. 480: 128916 (2024) - [j77]Mateusz Kamyczura
On conflict-free proper colourings of graphs without small degree vertices. Discret. Math. 347(1): 113712 (2024) - [j76]Jakub Przybylo
On triangle-free list assignments. Discret. Math. 347(2): 113779 (2024) - [j75]Mateusz Kamyczura
A note on the conflict-free chromatic index. Discret. Math. 347(4): 113897 (2024) - [j74]Jakub Przybylo
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment. Eur. J. Comb. 120: 103961 (2024) - [c1]Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo
First-Fit Coloring of Forests in Random Arrival Model. MFCS 2024: 33:1-33:10 - [i5]Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo:
First-Fit Coloring of Forests in Random Arrival Model. CoRR abs/2404.17011 (2024) - [i4]Borut Luzar, Jakub Przybylo, Roman Soták:
Degree-balanced decompositions of cubic graphs. CoRR abs/2408.16121 (2024) - 2023
- [j73]Jakub Przybylo
On the Asymptotic Confirmation of the Faudree-Lehel Conjecture for General Graphs. Comb. 43(4): 791-826 (2023) - [j72]Jakub Przybylo
Short Proof of the Asymptotic Confirmation of the Faudree-Lehel Conjecture. Electron. J. Comb. 30(4) (2023) - 2022
- [j71]Jakub Przybylo
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree. Comb. 42(Supplement 2): 1487-1512 (2022) - [j70]Michal Debski, Jakub Przybylo
Conflict-free chromatic number versus conflict-free chromatic index. J. Graph Theory 99(3): 349-358 (2022) - [j69]Jakub Przybylo
Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees. J. Graph Theory 100(1): 189-204 (2022) - [j68]Jakub Przybylo
A generalization of Faudree-Lehel conjecture holds almost surely for random graphs. Random Struct. Algorithms 61(2): 383-396 (2022) - 2021
- [j67]Jakub Przybylo
Largest Component and Node Fault Tolerance for Grids. Electron. J. Comb. 28(1): 1 (2021) - [j66]Jakub Przybylo
On the Standard (2, 2)-Conjecture. Eur. J. Comb. 94: 103305 (2021) - [j65]Jakub Przybylo
The 1-2-3 Conjecture almost holds for regular graphs. J. Comb. Theory B 147: 183-200 (2021) - [j64]Jakub Przybylo
On the inclusion chromatic index of a graph. J. Graph Theory 97(1): 5-20 (2021) - 2020
- [j63]Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak
On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory 40(4): 1175-1186 (2020) - [j62]Hervé Hocquard, Jakub Przybylo
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. J. Comb. Optim. 39(2): 412-424 (2020)
2010 – 2019
- 2019
- [j61]Marcin Anholcer
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs. Appl. Math. Comput. 343: 149-155 (2019) - [j60]Jakub Przybylo
Distant sum distinguishing index of graphs with bounded minimum degree. Ars Math. Contemp. 17(1): 37-49 (2019) - [j59]Julien Bensmail, Jakub Przybylo
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture. Discret. Appl. Math. 268: 1-9 (2019) - [j58]Jakub Przybylo
A note on the weak (2, 2)-Conjecture. Discret. Math. 342(2): 498-504 (2019) - [j57]Jakub Przybylo
Distant total sum distinguishing index of graphs. Discret. Math. 342(3): 683-688 (2019) - [j56]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) - [j55]Jakub Przybylo
A note on asymptotically optimal neighbour sum distinguishing colourings. Eur. J. Comb. 77: 49-56 (2019) - [j54]Jakub Kwasny
Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number. Random Struct. Algorithms 54(4): 768-778 (2019) - [i3]Jakub Przybylo:
On the Standard (2, 2)-Conjecture. CoRR abs/1911.00867 (2019) - 2018
- [j53]Mirko Hornák
A note on a directed version of the 1-2-3 Conjecture. Discret. Appl. Math. 236: 472-476 (2018) - [j52]Jakub Przybylo
Distant total irregularity strength of graphs via random vertex ordering. Discret. Math. 341(4): 1098-1102 (2018) - [j51]Sylwia Cichacz
Group twin coloring of graphs. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j50]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) - [j49]Jakub Przybylo
Distant set distinguishing edge colourings of graphs. Eur. J. Comb. 69: 185-199 (2018) - [j48]Borut Luzar
New bounds for locally irregular chromatic index of bipartite and subcubic graphs. J. Comb. Optim. 36(4): 1425-1438 (2018) - 2017
- [j47]Emma Barme, Julien Bensmail, Jakub Przybylo
On a directed variation of the 1-2-3 and 1-2 Conjectures. Discret. Appl. Math. 217: 123-131 (2017) - [j46]Jakub Przybylo
On weight choosabilities of graphs with bounded maximum average degree. Discret. Appl. Math. 217: 663-672 (2017) - [j45]Olivier Baudon, Monika Pilsniak
Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. 222: 40-53 (2017) - [j44]Jakub Przybylo
Distant irregularity strength of graphs with bounded minimum degree. Discret. Appl. Math. 233: 159-165 (2017) - [j43]Sarah Loeb, Jakub Przybylo
Asymptotically optimal neighbor sum distinguishing total colorings of graphs. Discret. Math. 340(2): 58-62 (2017) - [j42]Olivier Baudon, Jakub Przybylo
The neighbour-sum-distinguishing edge-colouring game. Discret. Math. 340(7): 1564-1572 (2017) - [j41]Jakub Przybylo
Distant sum distinguishing index of graphs. Discret. Math. 340(10): 2402-2407 (2017) - [j40]Hervé Hocquard, Jakub Przybylo
On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree. Graphs Comb. 33(6): 1459-1471 (2017) - [j39]Marthe Bonamy, Jakub Przybylo
On the Neighbor Sum Distinguishing Index of Planar Graphs. J. Graph Theory 85(3): 669-690 (2017) - [i2]Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
Equitable neighbour-sum-distinguishing edge and total colourings. CoRR abs/1701.04648 (2017) - 2016
- [j38]Jakub Przybylo:
On Decomposing Graphs of Large Minimum Degree into Locally Irregular Subgraphs. Electron. J. Comb. 23(2): 2 (2016) - [j37]Jakub Przybylo:
Distant Set Distinguishing Total Colourings of Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j36]Jakub Przybylo:
Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz. Discret. Appl. Math. 202: 163-173 (2016) - [j35]Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták
A note on adjacent vertex distinguishing colorings of graphs. Discret. Appl. Math. 205: 1-7 (2016) - [j34]Július Czap
On an extremal problem in the class of bipartite 1-planar graphs. Discuss. Math. Graph Theory 36(1): 141-151 (2016) - [j33]Jakub Przybylo, Jens Schreyer, Erika Skrabul'áková
On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method. Graphs Comb. 32(3): 1137-1153 (2016) - 2015
- [j32]Olivier Baudon
On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49: 90-104 (2015) - [j31]Jakub Przybylo, Tsai-Lien Wong:
Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited. J. Graph Theory 80(4): 299-312 (2015) - [j30]Jakub Przybylo:
Asymptotically optimal neighbour sum distinguishing colourings of graphs. Random Struct. Algorithms 47(4): 776-791 (2015) - 2014
- [j29]Jakub Przybylo:
Colour-blind Can Distinguish Colour Pallets. Electron. J. Comb. 21(2): 2 (2014) - [j28]Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak:
On the structure of arbitrarily partitionable graphs with given connectivity. Discret. Appl. Math. 162: 381-385 (2014) - [j27]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): 225-232 (2014) - [j26]Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
How to personalize the vertices of a graph? Eur. J. Comb. 40: 116-123 (2014) - [j25]Jakub Przybylo:
On colour-blind distinguishing colour pallets in regular graphs. J. Comb. Optim. 28(2): 348-357 (2014) - [j24]Piotr Majerski, Jakub Przybylo:
Total Vertex Irregularity Strength of Dense Graphs. J. Graph Theory 76(1): 34-41 (2014) - [j23]Jakub Przybylo:
On the Facial Thue Choice Index via Entropy Compression. J. Graph Theory 77(3): 180-189 (2014) - [j22]Piotr Majerski, Jakub Przybylo:
On the Irregularity Strength of Dense Graphs. SIAM J. Discret. Math. 28(1): 197-205 (2014) - [j21]Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
Partitioning powers of traceable or hamiltonian graphs. Theor. Comput. Sci. 520: 133-137 (2014) - [i1]Marthe Bonamy, Jakub Przybylo:
On the neighbour sum distinguishing index of planar graphs. CoRR abs/1408.3190 (2014) - 2013
- [j20]Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
Can Colour-Blind Distinguish Colour Palettes? Electron. J. Comb. 20(3): 23 (2013) - [j19]Jakub Przybylo:
On upper bounds for multiple domination numbers of graphs. Discret. Appl. Math. 161(16-17): 2758-2763 (2013) - [j18]Jakub Przybylo:
Distant irregularity strength of graphs. Discret. Math. 313(24): 2875-2880 (2013) - [j17]Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak:
Rainbow connection in sparse graphs. Discuss. Math. Graph Theory 33(1): 181-192 (2013) - [j16]Evelyne Flandrin, Antoni Marczyk, Jakub Przybylo, Jean-François Saclé, Mariusz Wozniak:
Neighbor Sum Distinguishing Index. Graphs Comb. 29(5): 1329-1336 (2013) - [j15]Jakub Przybylo:
Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz. SIAM J. Discret. Math. 27(3): 1313-1322 (2013) - 2012
- [j14]Leonid Plachta, Jakub Przybylo, Mariusz Wozniak:
Seifert graphs and the braid index of classical and singular links. Discret. Math. 312(18): 2819-2831 (2012) - [j13]Olivier Baudon, Jakub Przybylo, Mariusz Wozniak:
On minimal arbitrarily partitionable graphs. Inf. Process. Lett. 112(17-18): 697-700 (2012) - 2011
- [j12]Jakub Przybylo, Mariusz Wozniak:
Total Weight Choosability of Graphs. Electron. J. Comb. 18(1) (2011) - [j11]Sylwia Cichacz, Jakub Przybylo:
Irregular edge coloring of 2-regular graphs. Discret. Math. Theor. Comput. Sci. 13(1): 1-12 (2011) - [j10]Jaroslaw Grytczuk
Nonrepetitive list colourings of paths. Random Struct. Algorithms 38(1-2): 162-173 (2011) - 2010
- [j9]Sylwia Cichacz, Jakub Przybylo:
Vertex-distinquishing edge-colorings of linear forests. Discuss. Math. Graph Theory 30(1): 95-103 (2010) - [j8]Jakub Przybylo, Mariusz Wozniak:
On a 1, 2 Conjecture. Discret. Math. Theor. Comput. Sci. 12(1): 101-108 (2010)
2000 – 2009
- 2009
- [j7]Sylwia Cichacz
Decompositions of pseudographs into closed trails of even sizes. Discret. Math. 309(15): 4903-4908 (2009) - [j6]Marcin Anholcer
A new upper bound for the total vertex irregularity strength of graphs. Discret. Math. 309(21): 6316-6317 (2009) - [j5]Jakub Przybylo:
Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs. SIAM J. Discret. Math. 23(1): 511-516 (2009) - 2008
- [j4]Sylwia Cichacz, Jakub Przybylo, Mariusz Wozniak:
Irregular edge-colorings of sums of cycles of even lengths. Australas. J Comb. 40: 41-56 (2008) - [j3]Jakub Przybylo:
Irregularity Strength of Regular Graphs. Electron. J. Comb. 15(1) (2008) - [j2]Jakub Przybylo:
A Note on Neighbour-Distinguishing Regular Graphs Total-Weighting. Electron. J. Comb. 15(1) (2008) - 2006
- [j1]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): 291-305 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: