Florian Lehner

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