1 citations · 1 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2017
On tree-decompositions of one-ended graphs
Johannes Carmesin, Florian Lehner, Rögnvaldur G. Möller
A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which…
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…