Aleksandra Gorzkowska

activity

20192026

most citedThe Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs

2 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2026

Distinguishing adjacent vertices by ordering edges

Aleksandra Gorzkowska, Jakub Kwaśny

The 1-2-3 Conjecture states that for every graph without isolated edges, there exists an edge-weighting from ${1, 2, 3}$ such that adjacent vertices receive distinct sums of weight…

math.CO2026

Locally Irregular Total Colorings of Graphs

Anna Flaszczyńska, Aleksandra Gorzkowska, Igor Grzelec +2

A total graph is an ordered triple $(V_{0}, V_{1}, E)$ , where $V_{0}, V_{1}$ are the sets of empty and full vertices, respectively, $V_{0} \cap V_{1} = \emptyset$ , and the set of edges $E$ is…

math.CO2024

A note on sequences variant of irregularity strength for hypercubes

Anna Flaszczyńska, Aleksandra Gorzkowska, Mariusz Woźniak

Let $f : E \mapsto {1, 2, \dots, k}$ be an edge coloring of the $n$ - dimensional hypercube $H_{n}$ . By the palette at a vertex $v$ we mean the sequence $\left(f(e_1(v)), f(e_1(v)),\do…

math.CO2024

Arc-distinguishing of orientations of graphs

Aleksandra Gorzkowska, Jakub Kwaśny

The distinguishing index $D^{'} (G)$ of a graph $G$ is the minimum number of colours in an edge colouring preserved only by the identity automorphism. We study how orienting the edges…

math.CO2023

Majority distinguishing edge coloring

Aleksandra Gorzkowska, Magdalena Prorok

We consider edge colorings of graphs. An edge coloring is a majority coloring if for every vertex at most half of the edges incident with it are in one color. And edge coloring is…

math.CO2019★ 2 cited

The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs

Aleksandra Gorzkowska, Mohammad Hadi Shekarriz

A graph $G$ is said to be $d$ -distinguishable if there is a vertex coloring of $G$ with a set of $d$ colors which breaks all of the automorphisms of $G$ but the identity. We call t…