3 papers
math.CO2019
On asymmetric colourings of graphs with bounded degrees and infinite motion
Florian Lehner, Monika Pilśniak, Marcin Stawiski
A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locall…
math.CO2019
A bound for the distinguishing index of regular graphs
Florian Lehner, Monika Pilśniak, Marcin Stawiski
An edge-colouring of a graph is distinguishing, if the only automorphism which preserves the colouring is the identity. It has been conjectured that all but finitely many connected…
math.CO2018
Distinguishing infinite graphs with bounded degrees
Florian Lehner, Monika Pilśniak, Marcin Stawiski
Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph move…