Jakub Przybyło

From MaRDI portal
Person:244962

Available identifiers

zbMath Open przybylo.jakubWikidataQ102368189 ScholiaQ102368189MaRDI QIDQ244962

List of research outcomes





PublicationDate of PublicationType
On generalised majority edge-colourings of graphs2025-01-27Paper
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment2024-07-08Paper
Inclusion chromatic index of random graphs2024-04-29Paper
A note on decomposing graphs to locally almost irregular subgraphs2024-04-18Paper
A note on the conflict-free chromatic index2024-02-19Paper
On triangle-free list assignments2024-01-25Paper
On a problem of Steinhaus2023-12-18Paper
On conflict-free proper colourings of graphs without small degree vertices2023-10-30Paper
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs2023-10-17Paper
Conflict‐free chromatic number versus conflict‐free chromatic index2023-10-05Paper
Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees2023-10-05Paper
On the inclusion chromatic index of a graph2023-09-29Paper
On generalised majority edge-colourings of graphs2023-09-28Paper
Mrs. Correct and Majority Colorings2022-07-20Paper
On the standard \((2,2)\)-conjecture2021-04-14Paper
Largest component and node fault tolerance for grids2021-03-17Paper
The 1-2-3 conjecture almost holds for regular graphs2021-02-03Paper
On a total version of 1-2-3 conjecture2020-08-26Paper
The 1-2-3 Conjecture holds for graphs with large enough minimum degree2020-03-29Paper
Distant sum distinguishing index of graphs with bounded minimum degree2020-02-21Paper
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree2020-02-03Paper
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs2019-11-22Paper
Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture2019-09-19Paper
Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number2019-08-14Paper
https://portal.mardi4nfdi.de/entity/Q53772212019-05-23Paper
A note on asymptotically optimal neighbour sum distinguishing colourings2019-01-29Paper
Distant total sum distinguishing index of graphs2019-01-22Paper
https://portal.mardi4nfdi.de/entity/Q45602602018-12-10Paper
Group twin coloring of graphs2018-12-10Paper
New bounds for locally irregular chromatic index of bipartite and subcubic graphs2018-12-06Paper
A note on the weak \((2,2)\)-conjecture2018-11-29Paper
Equitable neighbour-sum-distinguishing edge and total colourings2018-09-25Paper
Distant total irregularity strength of graphs via random vertex ordering2018-02-23Paper
On the neighbour sum distinguishing index of graphs with bounded maximum average degree2018-02-14Paper
A note on a directed version of the 1-2-3 conjecture2018-01-11Paper
Distant set distinguishing edge colourings of graphs2017-12-21Paper
Distant irregularity strength of graphs with bounded minimum degree2017-10-17Paper
On the Neighbor Sum Distinguishing Index of Planar Graphs2017-08-08Paper
Distant sum distinguishing index of graphs2017-08-01Paper
The neighbour-sum-distinguishing edge-colouring game2017-05-10Paper
On a directed variation of the 1-2-3 and 1-2 conjectures2017-03-15Paper
On weight choosabilities of graphs with bounded maximum average degree2017-03-15Paper
Asymptotically optimal neighbor sum distinguishing total colorings of graphs2016-12-14Paper
Distant set distinguishing total colourings of graphs2016-07-06Paper
On the facial Thue choice number of plane graphs via entropy compression method2016-06-09Paper
On decomposing graphs of large minimum degree into locally irregular subgraphs2016-05-20Paper
A note on adjacent vertex distinguishing colorings of graphs2016-04-07Paper
Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz2016-02-12Paper
Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited2016-02-01Paper
On an extremal problem in the class of bipartite 1-planar graphs2016-01-26Paper
Asymptotically optimal neighbour sum distinguishing colourings of graphs2016-01-07Paper
On decomposing regular graphs into locally irregular subgraphs2015-06-18Paper
On the Facial Thue Choice Index via Entropy Compression2014-11-17Paper
On the facial Thue choice index via entropy compression2014-11-17Paper
On the structure of arbitrarily partitionable graphs with given connectivity2014-09-12Paper
Colour-blind can distinguish colour pallets2014-09-04Paper
How to personalize the vertices of a graph?2014-08-28Paper
Can colour-blind distinguish colour palettes?2014-08-14Paper
On colour-blind distinguishing colour pallets in regular graphs2014-07-11Paper
On the Irregularity Strength of Dense Graphs2014-06-19Paper
Total Vertex Irregularity Strength of Dense Graphs2014-05-28Paper
https://portal.mardi4nfdi.de/entity/Q54139122014-05-02Paper
On upper bounds for multiple domination numbers of graphs2014-04-10Paper
https://portal.mardi4nfdi.de/entity/Q54030512014-03-25Paper
Distant irregularity strength of graphs2014-01-27Paper
Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz2014-01-21Paper
Partitioning powers of traceable or Hamiltonian graphs2014-01-13Paper
Rainbow connection in sparse graphs2013-12-13Paper
Neighbor sum distinguishing index2013-09-26Paper
On minimal arbitrarily partitionable graphs2012-10-23Paper
Seifert graphs and the braid index of classical and singular links2012-09-12Paper
Total weight choosability of graphs2011-06-01Paper
Nonrepetitive list colourings of paths2011-01-17Paper
Vertex-distinguishing edge-colorings of linear forests2010-12-08Paper
On a \(1,2\) conjecture2010-07-27Paper
A new upper bound for the total vertex irregularity strength of graphs2009-12-15Paper
Decompositions of pseudographs into closed trails of even sizes2009-12-15Paper
Irregularity strength of regular graphs2009-04-07Paper
A note on neighbour-distinguishing regular graphs total-weighting2009-04-07Paper
Arbitrarily vertex decomposable caterpillars with four or five leaves2008-07-01Paper
Irregular edge-colorings of sums of cycles of even lengths2008-03-11Paper
Decomposability of regular graphs to $4$ locally irregular subgraphsN/APaper

Research outcomes over time

This page was built for person: Jakub Przybyło