Jakub Przyby{\l}o

Identifiers

• name variant Jakub Przyby{\l}o 0.60 · backfill

Papers (22)

1. Asymptotically Tight Bound for the Conflict-Free Chromatic Index math.CO · 2026 · author #2
2. Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs math.CO · 2018 · author #3
3. Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture math.CO · 2018 · author #2
4. On the total neighbour sum distinguishing index of graphs with bounded maximum average degree math.CO · 2018 · author #2
5. Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number math.CO · 2017 · author #2
6. Distant total sum distinguishing index of graphs math.CO · 2017 · author #1
7. Distant sum distinguishing index of graphs with bounded minimum degree math.CO · 2017 · author #1
8. Distant sum distinguishing index of graphs math.CO · 2017 · author #1
9. Distant irregularity strength of graphs with bounded minimum degree math.CO · 2017 · author #1
10. A note on asymptotically optimal neighbour sum distinguishing colourings math.CO · 2017 · author #1
11. Distant total irregularity strength of graphs via random vertex ordering math.CO · 2017 · author #1
12. New bounds for locally irregular chromatic index of bipartite and subcubic graphs math.CO · 2016 · author #2
13. On the neighbour sum distinguishing index of graphs with bounded maximum average degree math.CO · 2015 · author #2
14. Distant set distinguishing total colourings of graphs math.CO · 2015 · author #1
15. Distant set distinguishing edge colourings of graphs math.CO · 2015 · author #1
16. On decomposing graphs of large minimum degree into locally irregular subgraphs math.CO · 2015 · author #1
17. Asymptotically optimal neighbour sum distinguishing total colourings of graphs math.CO · 2015 · author #1
18. Asymptotically optimal neighbor sum distinguishing total colorings of graphs math.CO · 2015 · author #2
19. On an extremal problem in the class of 1-planar graphs math.CO · 2014 · author #2
20. On the neighbour sum distinguishing index of planar graphs cs.DM · 2014 · author #2
21. On the facial Thue choice number of plane graphs via entropy compression method math.CO · 2013 · author #1
22. On the facial Thue choice index via entropy compression math.CO · 2012 · author #1

Mentions

• 1308.5128 #1 · backfill · confidence 0.70 Jakub Przyby{\l}o
• 1207.0964 #1 · backfill · confidence 0.70 Jakub Przyby{\l}o

Frequent Coauthors

• Erika \v{S}krabu\v{l}\'akov\'a 2 shared papers
• Herv\'e Hocquard 2 shared papers
• Borut Lu\v{z}ar 1 shared papers
• Jakub Kwa\'sny 1 shared papers
• Jens Schreyer 1 shared papers
• Julien Bensmail 1 shared papers
• J\'ulius Czap 1 shared papers
• Marcin Anholcer 1 shared papers
• Marthe Bonamy 1 shared papers
• Mateusz Kamyczura 1 shared papers
• Roman Sot\'ak 1 shared papers
• Sarah Loeb 1 shared papers
• Sylwia Cichacz 1 shared papers
• Yunfang Tang 1 shared papers