M. Pil'sniak

collaborators

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

On 3-colorability of (claw, diamond)-free graphs

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

The $3$ -colorability problem is a well-known NP-complete problem and it remains NP-complete for $(c l a w, d iam o n d, K_{4})$ -free graphs. Recently, $3$ -colorability has been also conside…

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

On $k$ -colorability of $(b u l l, H)$ -free graphs

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

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

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-…

Strong majority colorings of graphs

On 3-colorability of (claw, diamond)-free graphs

Quasi-majority neighbor sum distinguishing edge-colorings

On k-colorability of (bull,H)-free graphs

Distinguishing finite and infinite trees of arbitrary cardinality

Distinguishing symmetric digraphs by proper arc-colourings of type I

On $k$ -colorability of $(b u l l, H)$ -free graphs