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 2021Show all

2 papers · 1 filter

math.CO2021

Factorizations of regular graphs of infinite degree

Marcin Stawiski

Let $H = {H_{i} : i < α}$ be an indexed family of graphs for some ordinal number $α$ . $H$ -decomposition of a graph $G$ is a family $G = {G_{i} : i < α}$ of edge…

math.CO2021

Distinguishing infinite star-free graphs

Marcin Stawiski

Call a colouring of a graph \emph{distinguishing} if the only automorphism of this graph which preserves said colouring is the identity. Let $H$ be an arbitrary graph. We say that…