According to our database
1,
Jakub Przybylo
authored at least 82 papers
between 2006 and 2024.
Collaborative distances:
2024
A note on the conflict-free chromatic index.
Discret. Math., April, 2024
On triangle-free list assignments.
Discret. Math., February, 2024
On conflict-free proper colourings of graphs without small degree vertices.
Discret. Math., January, 2024
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment.
Eur. J. Comb., 2024
Degree-balanced decompositions of cubic graphs.
CoRR, 2024
Decomposability of regular graphs to 4 locally irregular subgraphs.
Appl. Math. Comput., 2024
A note on decomposing graphs to locally almost irregular subgraphs.
Appl. Math. Comput., 2024
First-Fit Coloring of Forests in Random Arrival Model.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
2023
On the Asymptotic Confirmation of the Faudree-Lehel Conjecture for General Graphs.
Comb., August, 2023
Short Proof of the Asymptotic Confirmation of the Faudree-Lehel Conjecture.
Electron. J. Comb., 2023
2022
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree.
Comb., December, 2022
A generalization of Faudree-Lehel conjecture holds almost surely for random graphs.
Random Struct. Algorithms, 2022
Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees.
J. Graph Theory, 2022
Conflict-free chromatic number versus conflict-free chromatic index.
J. Graph Theory, 2022
2021
On the inclusion chromatic index of a graph.
J. Graph Theory, 2021
The 1-2-3 Conjecture almost holds for regular graphs.
J. Comb. Theory B, 2021
On the Standard (2, 2)-Conjecture.
Eur. J. Comb., 2021
Largest Component and Node Fault Tolerance for Grids.
Electron. J. Comb., 2021
2020
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree.
J. Comb. Optim., 2020
On a total version of 1-2-3 Conjecture.
Discuss. Math. Graph Theory, 2020
2019
Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number.
Random Struct. Algorithms, 2019
A note on asymptotically optimal neighbour sum distinguishing colourings.
Eur. J. Comb., 2019
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.
Discret. Math. Theor. Comput. Sci., 2019
Distant total sum distinguishing index of graphs.
Discret. Math., 2019
A note on the weak (2, 2)-Conjecture.
Discret. Math., 2019
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture.
Discret. Appl. Math., 2019
Distant sum distinguishing index of graphs with bounded minimum degree.
Ars Math. Contemp., 2019
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs.
Appl. Math. Comput., 2019
2018
New bounds for locally irregular chromatic index of bipartite and subcubic graphs.
J. Comb. Optim., 2018
Distant set distinguishing edge colourings of graphs.
Eur. J. Comb., 2018
Group twin coloring of graphs.
Discret. Math. Theor. Comput. Sci., 2018
On locally irregular decompositions and the 1-2 Conjecture in digraphs.
Discret. Math. Theor. Comput. Sci., 2018
Distant total irregularity strength of graphs via random vertex ordering.
Discret. Math., 2018
A note on a directed version of the 1-2-3 Conjecture.
Discret. Appl. Math., 2018
2017
On the Neighbor Sum Distinguishing Index of Planar Graphs.
J. Graph Theory, 2017
On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree.
Graphs Comb., 2017
Distant sum distinguishing index of graphs.
Discret. Math., 2017
Asymptotically optimal neighbor sum distinguishing total colorings of graphs.
Discret. Math., 2017
The neighbour-sum-distinguishing edge-colouring game.
Discret. Math., 2017
On weight choosabilities of graphs with bounded maximum average degree.
Discret. Appl. Math., 2017
Distant irregularity strength of graphs with bounded minimum degree.
Discret. Appl. Math., 2017
Equitable neighbour-sum-distinguishing edge and total colourings.
Discret. Appl. Math., 2017
On a directed variation of the 1-2-3 and 1-2 Conjectures.
Discret. Appl. Math., 2017
2016
On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method.
Graphs Comb., 2016
On an extremal problem in the class of bipartite 1-planar graphs.
Discuss. Math. Graph Theory, 2016
Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz.
Discret. Appl. Math., 2016
A note on adjacent vertex distinguishing colorings of graphs.
Discret. Appl. Math., 2016
Distant Set Distinguishing Total Colourings of Graphs.
Electron. J. Comb., 2016
On Decomposing Graphs of Large Minimum Degree into Locally Irregular Subgraphs.
Electron. J. Comb., 2016
2015
Asymptotically optimal neighbour sum distinguishing colourings of graphs.
Random Struct. Algorithms, 2015
Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited.
J. Graph Theory, 2015
On decomposing regular graphs into locally irregular subgraphs.
Eur. J. Comb., 2015
2014
Partitioning powers of traceable or hamiltonian graphs.
Theor. Comput. Sci., 2014
On the Irregularity Strength of Dense Graphs.
SIAM J. Discret. Math., 2014
On the Facial Thue Choice Index via Entropy Compression.
J. Graph Theory, 2014
Total Vertex Irregularity Strength of Dense Graphs.
J. Graph Theory, 2014
On colour-blind distinguishing colour pallets in regular graphs.
J. Comb. Optim., 2014
How to personalize the vertices of a graph?
Eur. J. Comb., 2014
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.
Discret. Math. Theor. Comput. Sci., 2014
On the structure of arbitrarily partitionable graphs with given connectivity.
Discret. Appl. Math., 2014
On the neighbour sum distinguishing index of planar graphs.
CoRR, 2014
Colour-blind Can Distinguish Colour Pallets.
Electron. J. Comb., 2014
2013
Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz.
SIAM J. Discret. Math., 2013
Neighbor Sum Distinguishing Index.
Graphs Comb., 2013
Rainbow connection in sparse graphs.
Discuss. Math. Graph Theory, 2013
Distant irregularity strength of graphs.
Discret. Math., 2013
On upper bounds for multiple domination numbers of graphs.
Discret. Appl. Math., 2013
Can Colour-Blind Distinguish Colour Palettes?
Electron. J. Comb., 2013
2012
On minimal arbitrarily partitionable graphs.
Inf. Process. Lett., 2012
Seifert graphs and the braid index of classical and singular links.
Discret. Math., 2012
2011
Nonrepetitive list colourings of paths.
Random Struct. Algorithms, 2011
Irregular edge coloring of 2-regular graphs.
Discret. Math. Theor. Comput. Sci., 2011
Total Weight Choosability of Graphs.
Electron. J. Comb., 2011
2010
Discret. Math. Theor. Comput. Sci., 2010
Vertex-distinquishing edge-colorings of linear forests.
Discuss. Math. Graph Theory, 2010
2009
Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs.
SIAM J. Discret. Math., 2009
Decompositions of pseudographs into closed trails of even sizes.
Discret. Math., 2009
A new upper bound for the total vertex irregularity strength of graphs.
Discret. Math., 2009
2008
A Note on Neighbour-Distinguishing Regular Graphs Total-Weighting.
Electron. J. Comb., 2008
Irregularity Strength of Regular Graphs.
Electron. J. Comb., 2008
Irregular edge-colorings of sums of cycles of even lengths.
Australas. J Comb., 2008
2006
Arbitrarily vertex decomposable caterpillars with four or five leaves.
Discuss. Math. Graph Theory, 2006
