Monika Pilśniak

activity

20172025

collaborators

8 papers

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 $Δ (G)$ o…

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.CO2024

A note on edge colorings distinguishing all triangles in a graph

Monika Pilsniak, Mariusz Wozniak

We consider edge colorings of a graph in such a way that each two different triangles have distinct colorings. It is an extension of the well-known idea of distinguishing all maxim…

math.CO2024

On 3-colourability of $(b u l l, H)$ -free graphs

Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok +1

The $3$ -colourability problem is a well-known NP-complete problem and it remains NP-complete for $b u l l$ -free graphs, where $b u l l$ is the graph consisting of $K_{3}$ with two pendant…

math.CO2023

The Sierpiński Domination Number

Michael A. Henning, Sandi Klavžar, Elżbieta Kleszcz +1

Let $G$ and $H$ be graphs and let $f : V (G) \to V (H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$ , denoted by $G \otimes_{f} H$ , is defined…

math.CO2023

A note on uniquely embeddable 2-factors

Igor Grzelec, Monika Pilśniak, Mariusz Woźniak

Let $C_{n_{1}} \cup C_{n_{2}} \cup \dots \cup C_{n_{k}}$ be a 2-factor i.e. a vertex-disjoint union of cycles. In this note we completely characterize those 2-factors that are uniquely em…