R. Kalinowski

collaborators

5 papers

math.CO2026

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…

math.CO2025

Quasi-majority neighbor sum distinguishing edge-colorings

RafaÅ Kalinowski, Monika PilÅniak, ElÅ¼bieta Sidorowicz +1

In this paper, a $k$ -edge-coloring of $G$ is any mapping $c : E (G) ⟶ [k]$ . The edge-coloring $c$ of $G$ naturally defines a vertex-coloring $I ¨ _{c} : V (G) \to N$ …

math.CO2025

Distinguishing finite and infinite trees of arbitrary cardinality

Wilfried Imrich, RafaÅ Kalinowski, Florian Lehner +2

Let $G$ be a finite or infinite graph and $m (G)$ the minimum number of vertices moved by the non-identity automorphisms of $G$ . We are interested in bounds on the supremum $I^ (G)$ …

math.CO2025

Distinguishing symmetric digraphs by proper arc-colourings of type I

RafaÅ Kalinowski, Monika PilÅniak, Magdalena Prorok

A symmetric digraph $G$ is obtained from a simple graph $G$ by replacing each edge $uv$ with a pair of opposite arcs $uv$ , $v u$ . An arc-…

math.CO2025

On the distinguishing chromatic number in hereditary graph classes

Christoph Brause, RafaÅ Kalinowski, Monika PilÅniak +1

The distinguishing chromatic number of a graph $G$ , denoted $I ¨ _{D} (G)$ , is the minimum number of colours in a proper vertex colouring of $G$ that is preserved by the identity automo…