J. Przybylo

activity

20122024

most citedOn the facial Thue choice index via entropy compression

24 citations · 120 across the 33 of their papers we have counts for

collaborators

Showing 2017Show all

9 papers · 1 filter

math.CO2017

Group twin coloring of graphs

Sylwia Cichacz, Jakub Przybyło

For a given graph $G$ , the least integer $k \geq 2$ such that for every Abelian group $G$ of order $k$ there exists a proper edge labeling $f : E (G) \to G$ …

math.CO2017★ 6 cited

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 $G$ without isolated edges is its proper edge colouring such that no pair of adjacent vertices meets the same set of col…

math.CO2017★ 1 cited

Distant total sum distinguishing index of graphs

Jakub Przybyło

Let $c : V \cup E \to {1, 2, \dots, k}$ be a proper total colouring of a graph $G = (V, E)$ with maximum degree $Δ$ . We say vertices $u, v \in V$ are sum distinguished if $c(u)+\sum_{e\ni u}…

math.CO2017

Distant sum distinguishing index of graphs with bounded minimum degree

Jakub Przybyło

For any graph $G = (V, E)$ with maximum degree $Δ$ and without isolated edges, and a positive integer $r$ , by $χ_{Σ, r}^{'} (G)$ we denote the $r$ -distant sum distinguishing index of $G$ .…

math.CO2017★ 3 cited

Distant sum distinguishing index of graphs

Jakub Przybyło

Consider a positive integer $r$ and a graph $G = (V, E)$ with maximum degree $Δ$ and without isolated edges. The least $k$ so that a proper edge colouring $c : E \to {1, 2, \dots, k}$ exi…

math.CO2017★ 6 cited

Distant irregularity strength of graphs with bounded minimum degree

Jakub Przybyło

Consider a graph $G = (V, E)$ without isolated edges and with maximum degree $Δ$ . Given a colouring $c : E \to {1, 2, \dots, k}$ , the weighted degree of a vertex $v \in V$ is the sum of it…

math.CO2017★ 13 cited

A note on asymptotically optimal neighbour sum distinguishing colourings

Jakub Przybyło

The least $k$ admitting a proper edge colouring $c : E \to {1, 2, \dots, k}$ of a graph $G = (V, E)$ without isolated edges such that $\sum_{e ∋ u} c (e) \neq = \sum_{e ∋ v} c (e)$ for every $…

math.CO2017★ 2 cited

Distant total irregularity strength of graphs via random vertex ordering

Jakub Przybyło

Let $c : V \cup E \to {1, 2, \dots, k}$ be a (not necessarily proper) total colouring of a graph $G = (V, E)$ with maximum degree $Δ$ . Two vertices $u, v \in V$ are sum distinguished if they…

cs.DM2017

Equitable neighbour-sum-distinguishing edge and total colourings

Olivier Baudon, Monika Pilsniak, Jakub Przybylo +3

With any (not necessarily proper) edge $k$ -colouring $γ : E (G) ⟶ {1, \dots, k}$ of a graph $G$ ,one can associate a vertex colouring $σ_γ$ given by $σ\_γ(v)=\sum\_{e\ni v…