Przybyło, Jakub

1. On conflict-free proper colourings of graphs without small degree vertices
   2022/12/17 by Kamyczura, Mateusz, Przybyło, Jakub · 3 citations
   #Combinatorics (math.CO) #FOS: Mathematics
2. The 1-2-3 Conjecture holds for graphs with large enough minimum degree
   2020/03/29 by Jakub Przybyło, Przybyło, Jakub · 2 citations
   Computer Science · Mathematics · #05C15 #05C78 #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
3. On the asymptotic confirmation of the Faudree-Lehel Conjecture for general graphs
   2021/09/09 by Przybyło, Jakub, Wei, Fan · 2 citations
   #05C07 #05C35 #Combinatorics (math.CO) #FOS: Mathematics
4. The 1-2-3 Conjecture almost holds for regular graphs
   2018/09/27 by Przybyło, Jakub · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
5. Short proof of the asymptotic confirmation of the Faudree-Lehel Conjecture
   2021/09/27 by Przybyło, Jakub, Wei, Fan · 1 citation
   #05C07 #05C35 #Combinatorics (math.CO) #FOS: Mathematics
6. Mrs. Correct and Majority Colorings
   2022/07/20 by Anholcer, Marcin, Bosek, Bartłomiej, Grytczuk, Jarosław +3 · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
7. On generalised majority edge-colourings of graphs
   2023/09/28 by Paweł Pękała, Pękała, Paweł, Jakub Przybyło +1 · 1 citation
   Mathematics · #05C15 #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory