Random Colourings and Automorphism Breaking in Locally Finite Graphs. - Florian Lehner (Comb. Probab. Comput., 2013)

Distinguishing graphs with infinite motion and nonlinear growth. - Johannes Cuno; Wilfried Imrich; Florian Lehner (Ars Math. Contemp., 2014)

Endomorphism Breaking in Graphs. - Wilfried Imrich; Rafal Kalinowski; Florian Lehner; Monika Pilsniak (Electron. J. Comb., 2014)

On spanning tree packings of highly edge connected graphs. - Florian Lehner (J. Comb. Theory B, 2014)

Local Finiteness, Distinguishing Numbers, and Tucker's Conjecture. - Florian Lehner; Rögnvaldur G. Möller (Electron. J. Comb., 2015)

Fast Factorization of Cartesian products of Hypergraphs. - Marc Hellmuth; Florian Lehner (CoRR, 2015)

The Cartesian product of graphs with loops. - Tetiana Boiko; Johannes Cuno; Wilfried Imrich; Florian Lehner; Christiaan E. van de Woestijne (Ars Math. Contemp., 2016)

Distinguishing graphs with intermediate growth. - Florian Lehner (Comb., 2016)

Extending Cycles Locally to Hamilton Cycles. - Matthias Hamann; Florian Lehner; Julian Pott (Electron. J. Comb., 2016)

Fast factorization of Cartesian products of (directed) hypergraphs. - Marc Hellmuth; Florian Lehner (Theor. Comput. Sci., 2016)

Pursuit evasion on infinite graphs. - Florian Lehner (Theor. Comput. Sci., 2016)

Inter-Protocol Steganography for Real-Time Services and Its Detection Using Traffic Coloring Approach. - Florian Lehner; Wojciech Mazurczyk; Jörg Keller 001; Steffen Wendzel (LCN, 2017)

A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. - Nathan J. Bowler; Joshua Erde; Florian Lehner; Martin Merker; Max Pitz; Konstantinos S. Stavropoulos (Discret. Appl. Math., 2017)

Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number. - Florian Lehner; Stephan Wagner 003 (Graphs Comb., 2017)

Breaking graph symmetries by edge colourings. - Florian Lehner (J. Comb. Theory B, 2017)

Clique Trees of Infinite Locally Finite Chordal Graphs. - Christoph Hofer-Temmel; Florian Lehner (Electron. J. Comb., 2018)

Non-reconstructible locally finite graphs. - Nathan J. Bowler; Joshua Erde; Peter Heinig; Florian Lehner; Max Pitz (J. Comb. Theory B, 2018)

Firefighting on trees and Cayley graphs. - Florian Lehner (Australas. J Comb., 2019)

Counterexamples to "A conjecture on induced subgraphs of Cayley graphs". - Florian Lehner; Gabriel Verret (Ars Math. Contemp., 2020)

Distinguishing numbers of finite 4-valent vertex-transitive graphs. - Florian Lehner; Gabriel Verret (Ars Math. Contemp., 2020)

On symmetries of edge and vertex colourings of graphs. - Florian Lehner; Simon M. Smith (Discret. Math., 2020)

Trees with distinguishing index equal distinguishing number plus one. - Saeid Alikhani; Sandi Klavzar; Florian Lehner; Samaneh Soltani (Discuss. Math. Graph Theory, 2020)

Distinguishing density and the Distinct Spheres Condition. - Wilfried Imrich; Florian Lehner; Simon M. Smith (Eur. J. Comb., 2020)

A bound for the distinguishing index of regular graphs. - Florian Lehner; Monika Pilsniak; Marcin Stawiski (Eur. J. Comb., 2020)

Hamilton decompositions of one-ended Cayley graphs. - Joshua Erde; Florian Lehner; Max Pitz (J. Comb. Theory, Ser. B, 2020)

Invariant spanning double rays in amenable groups. - Agelos Georgakopoulos; Florian Lehner (Discret. Math., 2021)

On the cop number of toroidal graphs. - Florian Lehner (J. Comb. Theory B, 2021)

Bounding the Cop Number of a Graph by Its Genus. - Nathan J. Bowler; Joshua Erde; Florian Lehner; Max Pitz (SIAM J. Discret. Math., 2021)

Comparing consecutive letter counts in multiple context-free languages. - Florian Lehner; Christian Lindorfer (Theor. Comput. Sci., 2021)

Corrigendum to "A bound for the distinguishing index of regular graphs" [European J. Combin. 89 (2020) 103145]. - Florian Lehner; Monika Pilsniak; Marcin Stawiski (Eur. J. Comb., 2022)

A Stallings type theorem for quasi-transitive graphs. - Matthias Hamann; Florian Lehner; Babak Miraftab; Tim Rühmann (J. Comb. Theory B, 2022)

Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups. - Joshua Erde; Florian Lehner (J. Graph Theory, 2022)

Distinguishing infinite graphs with bounded degrees. - Florian Lehner; Monika Pilsniak; Marcin Stawiski (J. Graph Theory, 2022)

Self-avoiding walks and multiple context-free languages. - Florian Lehner; Christian Lindorfer (Comb. Theory, 2023)

A note on classes of subgraphs of locally finite graphs. - Florian Lehner (J. Comb. Theory B, 2023)

Universal Planar Graphs for the Topological Minor Relation. - Florian Lehner (Comb., 2024)

Folding polyominoes into cubes. - Oswin Aichholzer; Florian Lehner; Christian Lindorfer (CoRR, 2024)

Basis number of bounded genus graphs. - Florian Lehner; Babak Miraftab (CoRR, 2024)

Chromatic number is not tournament-local. - António Girão; Kevin Hendrey; Freddie Illingworth; Florian Lehner; Lukas Michel; Michael Savery; Raphael Steiner (J. Comb. Theory B, 2024)

Tipsy cop and tipsy robber: Collisions of biased random walks on graphs. - Pamela E. Harris; Erik Insko; Florian Lehner (Theor. Comput. Sci., 2024)

On weak cop numbers of transitive graphs. - Florian Lehner (Discret. Math., 2025)