24 citations · 120 across the 33 of their papers we have counts for
37 papers · 1 filter
On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
Mateusz Kamyczura, Jakub Przybyło
Let be a graph of maximum degree which does not contain isolated vertices. An edge coloring of is called conflict-free if each edge's closed neighborhood includes a…
The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
Jakub Przybyło
The irregularity strength of a graph , , is the least such that there exists a -weighting of the edges of attributing distinct weighted degrees t…
Decomposability of regular graphs to locally irregular subgraphs
Jakub Przybyło
A locally irregular graph is a graph whose adjacent vertices have distinct degrees. It was conjectured that every connected graph is edge decomposable to locally irregular subg…
On generalised majority edge-colourings of graphs
Paweł Pękała, Jakub Przybyło
A -majority -edge-colouring of a graph is a colouring of its edges with colours such that for every colour and each vertex of , at most $\frac{1}…
On conflict-free proper colourings of graphs without small degree vertices
Mateusz Kamyczura, Jakub Przybyło
A proper vertex colouring of a graph is referred to as conflict-free if in the neighbourhood of every vertex some colour appears exactly once, while it is called -conflict-f…
Mrs. Correct and Majority Colorings
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk +3
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techn…
On triangle-free list assignments
Jakub Przybyło
We show that Bernshteyn's proof of the breakthrough result of Molloy that triangle-free graphs are choosable from lists of size can be adapted to yield a stronger…
A note on the conflict-free chromatic index
Mateusz Kamyczura, Mariusz Meszka, Jakub Przybyło
Let be a graph with maximum degree and without isolated vertices. An edge colouring of is conflict-free if the closed neighbourhood of every edge includes a uniquel…
On the asymptotic confirmation of the Faudree-Lehel Conjecture for general graphs
Jakub Przybyło, Fan Wei
Given a simple graph , the {\it irregularity strength} of , denoted by , is the least positive integer such that there is a weight assignment on edges $f: E(G) \to…
Short proof of the asymptotic confirmation of the Faudree-Lehel Conjecture
Jakub Przybyło, Fan Wei
Given a simple graph , the {\it irregularity strength} of , denoted , is the least positive integer such that there is a weight assignment on edges $f: E(G) \to \{1…
Conflict-free chromatic number vs conflict-free chromatic index
Michał Dębski, Jakub Przybyło
A vertex coloring of a given graph is conflict-free if the closed neighborhood of every vertex contains a unique color (i.e. a color appearing only once in the neighborhood). T…
The 1-2-3 Conjecture holds for graphs with large enough minimum degree
Jakub Przybyło
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can…
Asymptotic confirmation of the Faudree-Lehel Conjecture on irregularity strength for all but extreme degrees
Jakub Przybyło
The irregularity strength of a graph , , is the least admitting a -weighting of the edges of assuring distinct weighted degrees of all vertices,…
On the Standard (2,2)-Conjecture
Jakub Przybyło
The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with , and so that adjacent vertices receive distinct weig…
On inclusion chromatic index of a graph
Jakub Kwaśny, Jakub Przybyło
Let be the least number of colours necessary to properly colour the edges of a graph with minimum degree so that the set of colours incident with any…
The 1-2-3 Conjecture almost holds for regular graphs
Jakub Przybyło
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with , and so that adjacent vertices receive distinct weight…
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
Marcin Anholcer, Sylwia Cichacz, Jakub Przybyło
We investigate the \textit{group irregularity strength}, , of a graph, i.e. the least integer such that taking any Abelian group of order , there exist…
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture
Julien Bensmail, Jakub Przybyło
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with , and so that adjacent vertices receive distinct weight…
On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
Hervé Hocquard, Jakub Przybyło
A proper total -colouring of a graph is an assignment of colours to the edges and the vertices of such that no two adjacent edge…
Group twin coloring of graphs
Sylwia Cichacz, Jakub Przybyło
For a given graph , the least integer such that for every Abelian group of order there exists a proper edge labeling …
Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number
Jakub Kwaśny, Jakub Przybyło
An adjacent vertex distinguishing edge colouring of a graph without isolated edges is its proper edge colouring such that no pair of adjacent vertices meets the same set of col…
Distant total sum distinguishing index of graphs
Jakub Przybyło
Let be a proper total colouring of a graph with maximum degree . We say vertices are sum distinguished if $c(u)+\sum_{e\ni u}…
Distant sum distinguishing index of graphs with bounded minimum degree
Jakub Przybyło
For any graph with maximum degree and without isolated edges, and a positive integer , by we denote the -distant sum distinguishing index of .…
Distant sum distinguishing index of graphs
Jakub Przybyło
Consider a positive integer and a graph with maximum degree and without isolated edges. The least so that a proper edge colouring exi…