Florian Lehner

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 36

Top Topics

Pursuit Evasion

Connected Graphs

Independent Set

Cartesian Product

Top Venues

J. Comb. Theory, Ser. B

Theor. Comput. Sci.

Electron. J. Comb.

Publications

António Girão, Kevin Hendrey, Freddie Illingworth, Florian Lehner, Lukas Michel, Michael Savery, Raphael Steiner
Chromatic number is not tournament-local. J. Comb. Theory B 168 (2024)
Florian Lehner
Universal Planar Graphs for the Topological Minor Relation. Comb. 44 (1) (2024)
Oswin Aichholzer, Florian Lehner, Christian Lindorfer
Folding polyominoes into cubes. CoRR (2024)
Pamela E. Harris, Erik Insko, Florian Lehner
Tipsy cop and tipsy robber: Collisions of biased random walks on graphs. Theor. Comput. Sci. 997 (2024)
Florian Lehner
A note on classes of subgraphs of locally finite graphs. J. Comb. Theory, Ser. B 161 (2023)
Joshua Erde, Florian Lehner
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups. J. Graph Theory 101 (3) (2022)
Florian Lehner, Monika Pilsniak, Marcin Stawiski
Distinguishing infinite graphs with bounded degrees. J. Graph Theory 101 (1) (2022)
Florian Lehner, Monika Pilsniak, Marcin Stawiski
Corrigendum to "A bound for the distinguishing index of regular graphs" [European J. Combin. 89 (2020) 103145]. Eur. J. Comb. 101 (2022)
Matthias Hamann, Florian Lehner, Babak Miraftab, Tim Rühmann
A Stallings type theorem for quasi-transitive graphs. J. Comb. Theory, Ser. B 157 (2022)
Florian Lehner
On the cop number of toroidal graphs. J. Comb. Theory, Ser. B 151 (2021)
Nathan J. Bowler, Joshua Erde, Florian Lehner, Max Pitz
Bounding the Cop Number of a Graph by Its Genus. SIAM J. Discret. Math. 35 (4) (2021)
Florian Lehner, Christian Lindorfer
Comparing consecutive letter counts in multiple context-free languages. Theor. Comput. Sci. 868 (2021)
Agelos Georgakopoulos, Florian Lehner
Invariant spanning double rays in amenable groups. Discret. Math. 344 (2) (2021)
Florian Lehner, Simon M. Smith
On symmetries of edge and vertex colourings of graphs. Discret. Math. 343 (9) (2020)
Florian Lehner, Christian Lindorfer
Self-avoiding walks and multiple context-free languages. CoRR (2020)
Saeid Alikhani, Sandi Klavzar, Florian Lehner, Samaneh Soltani
Trees with distinguishing index equal distinguishing number plus one. Discuss. Math. Graph Theory 40 (3) (2020)
Florian Lehner, Gabriel Verret
Distinguishing numbers of finite 4-valent vertex-transitive graphs. Ars Math. Contemp. 19 (2) (2020)
Florian Lehner, Christian Lindorfer
Comparing consecutive letter counts in multiple context-free languages. CoRR (2020)
Joshua Erde, Florian Lehner, Max Pitz
Hamilton decompositions of one-ended Cayley graphs. J. Comb. Theory, Ser. B 140 (2020)
Florian Lehner, Gabriel Verret
Counterexamples to "A conjecture on induced subgraphs of Cayley graphs". Ars Math. Contemp. 19 (1) (2020)
Florian Lehner, Monika Pilsniak, Marcin Stawiski
A bound for the distinguishing index of regular graphs. Eur. J. Comb. 89 (2020)
Wilfried Imrich, Florian Lehner, Simon M. Smith
Distinguishing density and the Distinct Spheres Condition. Eur. J. Comb. 89 (2020)
Florian Lehner
Firefighting on trees and Cayley graphs. Australas. J Comb. 75 (2019)
Christoph Hofer-Temmel, Florian Lehner
Clique Trees of Infinite Locally Finite Chordal Graphs. Electron. J. Comb. 25 (2) (2018)
Nathan J. Bowler, Joshua Erde, Peter Heinig, Florian Lehner, Max Pitz
Non-reconstructible locally finite graphs. J. Comb. Theory, Ser. B 133 (2018)
Nathan J. Bowler, Joshua Erde, Florian Lehner, Martin Merker, Max Pitz, Konstantinos S. Stavropoulos
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. Discret. Appl. Math. 229 (2017)
Florian Lehner, Stephan Wagner
Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number. Graphs Comb. 33 (5) (2017)
Florian Lehner, Wojciech Mazurczyk, Jörg Keller, Steffen Wendzel
Inter-Protocol Steganography for Real-Time Services and Its Detection Using Traffic Coloring Approach. LCN (2017)
Florian Lehner
Breaking graph symmetries by edge colourings. J. Comb. Theory, Ser. B 127 (2017)
Marc Hellmuth, Florian Lehner
Fast factorization of Cartesian products of (directed) hypergraphs. Theor. Comput. Sci. 615 (2016)
Florian Lehner
Pursuit evasion on infinite graphs. Theor. Comput. Sci. 655 (2016)
Matthias Hamann, Florian Lehner, Julian Pott
Extending Cycles Locally to Hamilton Cycles. Electron. J. Comb. 23 (1) (2016)
Tetiana Boiko, Johannes Cuno, Wilfried Imrich, Florian Lehner, Christiaan E. van de Woestijne
The Cartesian product of graphs with loops. Ars Math. Contemp. 11 (1) (2016)
Florian Lehner
Distinguishing graphs with intermediate growth. Comb. 36 (3) (2016)
Marc Hellmuth, Florian Lehner
Fast Factorization of Cartesian products of Hypergraphs. CoRR (2015)
Florian Lehner, Rögnvaldur G. Möller
Local Finiteness, Distinguishing Numbers, and Tucker's Conjecture. Electron. J. Comb. 22 (4) (2015)
Johannes Cuno, Wilfried Imrich, Florian Lehner
Distinguishing graphs with infinite motion and nonlinear growth. Ars Math. Contemp. 7 (1) (2014)
Wilfried Imrich, Rafal Kalinowski, Florian Lehner, Monika Pilsniak
Endomorphism Breaking in Graphs. Electron. J. Comb. 21 (1) (2014)
Florian Lehner
On spanning tree packings of highly edge connected graphs. J. Comb. Theory, Ser. B 105 (2014)
Florian Lehner
Random Colourings and Automorphism Breaking in Locally Finite Graphs. Comb. Probab. Comput. 22 (6) (2013)