3 citations · 5 across the 7 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Hamilton decompositions of one-ended Cayley graphs
Joshua Erde, Florian Lehner, Max Pitz
We prove that any one-ended, locally finite Cayley graph with non-torsion generators admits a decomposition into edge-disjoint Hamiltonian (i.e. spanning) double-rays. In particula…
math.CO2017★ 3 cited
Firefighting on trees and Cayley graphs
Florian Lehner
We study Hartnell's firefighter problem on infinite trees and characterise the branching number in terms of the firefighting game. Using our results about trees, we give a partial…
math.CO2017
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs
Nathan Bowler, Joshua Erde, Florian Lehner +3
A \emph{dynamic colouring} of a graph is a proper colouring in which no neighbourhood of a non-leaf vertex is monochromatic. The \emph{dynamic colouring number} of a graph…