12 citations · 23 across the 23 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
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…
math.CO2014
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…
math.CO2014★ 1 cited
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…