24 citations · 120 across the 33 of their papers we have counts for
7 papers · 1 filter
On the neighbour sum distinguishing index of graphs with bounded maximum average degree
Hervé Hocquard, Jakub Przybyło
A proper edge -colouring of a graph is an assignment of colours to the edges of the graph such that no two adjacent edges are associated with…
Distant set distinguishing total colourings of graphs
Jakub Przybyło
The Total Colouring Conjecture suggests that colours ought to suffice in order to provide a proper total colouring of every graph with maximum degree . Thus far this h…
Distant set distinguishing edge colourings of graphs
Jakub Przybyło
We consider the following extension of the concept of adjacent strong edge colourings of graphs without isolated edges. Two distinct vertices which are at distant at most in a…
On decomposing graphs of large minimum degree into locally irregular subgraphs
Jakub Przybyło
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph can be decomposed into locally irregular subgraphs if its edg…
Asymptotically optimal neighbour sum distinguishing total colourings of graphs
Jakub Przybyło
Consider a simple graph of maximum degree and its proper total colouring with the elements of the set . The colouring is said to be \emph{ne…
Asymptotically optimal neighbor sum distinguishing total colorings of graphs
Sarah Loeb, Jakub Przybyło, Yunfang Tang
Given a proper total -coloring of a graph , we define the value of a vertex to be . The smallest int…
On an extremal problem in the class of 1-planar graphs
Július Czap, Jakub Przybyło, Erika Škrabuľáková
A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite -planar graphs with presc…