Showing 2019Show all
2 papers · 1 filter
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…