1 citations · 1 across the 6 of their papers we have counts for
4 papers · 1 filter
Asymmetrizing infinite trees
Wilfried Imrich, Rafał Kalinowski, Florian Lehner +2
A graph is asymmetrizable if it has a set of vertices whose setwise stablizer only consists of the identity automorphism. The motion of a graph is the minimum number of ver…
Local finiteness, distinguishing numbers and Tucker's conjecture
Florian Lehner, Rögnvaldur G. Möller
A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial a…
The Cartesian product of graphs with loops
Tetiana Boiko, Johannes Cuno, Wilfried Imrich +2
We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still hold…
Cops, robbers, and infinite graphs
Florian Lehner
Cops and robbers is a game between two players, where one tries to catch the other by moving along the edges of a graph. It is well known that on a finite graph the cop has a winni…