6 citations · 6 across the 9 of their papers we have counts for
10 papers
Strong majority colorings of graphs
Rafał Kalinowski, Mateusz Kamyczura, Monika Pilśniak +1
Motivated by majority vertex-colorings of graphs and digraphs and majority edge-colorings of graphs, we introduce two concepts of strong majority colorings. A strong majority verte…
Quasi-majority neighbor sum distinguishing edge-colorings
Rafał Kalinowski, Monika Pilśniak, Elżbieta Sidorowicz +1
In this paper, a -edge-coloring of is any mapping . The edge-coloring of naturally defines a vertex-coloring ,…
Distinguishing finite and infinite trees of arbitrary cardinality
Wilfried Imrich, Rafał Kalinowski, Florian Lehner +2
Let be a finite or infinite graph and the minimum number of vertices moved by the non-identity automorphisms of . We are interested in bounds on the supremum o…
Distinguishing symmetric digraphs by proper arc-colourings of type I
Rafał Kalinowski, Monika Pilśniak, Magdalena Prorok
A symmetric digraph is obtained from a simple graph by replacing each edge with a pair of opposite arcs , . An arc-…
On the distinguishing chromatic number in hereditary graph classes
Christoph Brause, Rafał Kalinowski, Monika Pilśniak +1
The distinguishing chromatic number of a graph , denoted , is the minimum number of colours in a proper vertex colouring of that is preserved by the identity automor…
List majority edge-colorings of graphs
Rafał Kalinowski, Monika Pilśniak, Marcin Stawiski
A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex and every color , there are at most as many edges incident t…
Asymmetrizing infinite trees
Wilfried Imrich, Rafał Kalinowski, Florian Lehner +2
A graph is asymmetrizable if it has a set of vertices whose setwise stablizer only consists of the identity automorphism. The motion of a graph is the minimum number of ver…
Majority Edge-Colorings of Graphs
Felix Bock, Rafał Kalinowski, Johannes Pardey +3
We propose the notion of a majority -edge-coloring of a graph , which is an edge-coloring of with colors such that, for every vertex of , at most half the edge…
Bounds for Distinguishing Invariants of Infinite Graphs
Wilfried Imrich, Rafał Kalinowski, Monika Pilśniak +1
We consider infinite graphs. The distinguishing number of a graph is the minimum number of colours in a vertex colouring of that is preserved only by the trivial aut…
Endomorphism Breaking in Graphs
Wilfried Imrich, Rafał Kalinowski, Florian Lehner +1
We introduce the {\it endomorphism distinguishing number} of a graph as the least cardinal such that has a vertex coloring with colors that is only preserv…