2 citations · 2 across the 6 of their papers we have counts for
6 papers · 1 filter
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 such that adjacent vertices receive distinct sums of weight…
Locally Irregular Total Colorings of Graphs
Anna Flaszczyńska, Aleksandra Gorzkowska, Igor Grzelec +2
A total graph is an ordered triple , where are the sets of empty and full vertices, respectively, , and the set of edges is…
A note on sequences variant of irregularity strength for hypercubes
Anna Flaszczyńska, Aleksandra Gorzkowska, Mariusz Woźniak
Let be an edge coloring of the - dimensional hypercube . By the palette at a vertex we mean the sequence $\left(f(e_1(v)), f(e_1(v)),\do…
Arc-distinguishing of orientations of graphs
Aleksandra Gorzkowska, Jakub Kwaśny
The distinguishing index of a graph is the minimum number of colours in an edge colouring preserved only by the identity automorphism. We study how orienting the edges…
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…
The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs
Aleksandra Gorzkowska, Mohammad Hadi Shekarriz
A graph is said to be -distinguishable if there is a vertex coloring of with a set of colors which breaks all of the automorphisms of but the identity. We call t…