Marcin Stawiski

activity

20182026

most citedA bound for the distinguishing index of regular graphs

12 citations · 12 across the 16 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Breaking small automorphisms of graphs of arbitrary cardinality

Marcin Stawiski

We say that an edge colouring $c$ of a graph preserves an automorphism $φ$ if $φ$ maps each edge to an edge of the same colour. Otherwise, we say that $c$ breaks $φ$ . We call an au…

math.CO2026

Irreducible distinguishing colourings and the Axiom of Choice

Marcin Stawiski

We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is i…

math.CO2026

A new problem related to Eulerian graphs

Marcin Stawiski

Let $G$ be a graph, and $H$ be a finite subgraph of $G$ . We say that $H$ is a (semi) $S$ -Eulerian subgraph if there exists a closed (open) trail $T$ in $G$ such that each edge of $…