Florian Lehner

Generating author description...

All published works

Action	Title	Year	Authors
+	On asymmetric colourings of graphs with bounded degrees and infinite motion	2024	Florian Lehner Monika Pilśniak Marcin Stawiski
+ PDF Chat	Hamiltonicity of Transitive Graphs Whose Automorphism Group Has $\Z_{p}$ as Commutator Subgroups	2024	Florian Lehner Farzad Maghsoudi Babak Miraftab
+ PDF Chat	Basis number of bounded genus graphs	2024	Florian Lehner Babak Miraftab
+	Chromatic number is not tournament-local	2024	António Girão Kevin Hendrey Freddie Illingworth Florian Lehner Lukas Michel Michael Savery Raphael Steiner
+ PDF Chat	Locally finite graphs and their localization numbers	2024	Anthony Bonato Florian Lehner Trent G. Marbach JD Nir
+ PDF Chat	Catching a robber on a random <i>k</i>-uniform hypergraph	2024	Joshua Erde Mihyun Kang Florian Lehner Bojan Mohar Dominik Schmid
+	Tipsy cop and tipsy robber: Collisions of biased random walks on graphs	2024	Pamela E. Harris Erik Insko Florian Lehner
+ PDF Chat	Self-avoiding walk is ballistic on graphs with more than one end	2024	Florian Lehner Christian Lindorfer Christoforos Panagiotis
+ PDF Chat	Folding polyominoes into cubes	2024	Oswin Aichholzer Florian Lehner Christian Lindorfer
+	Universal Planar Graphs for the Topological Minor Relation	2023	Florian Lehner
+ PDF Chat	Asymmetric colouring of locally compact permutation groups	2023	Florian Lehner
+ PDF Chat	Self-avoiding walks and multiple context-free languages	2023	Florian Lehner Christian Lindorfer
+ PDF Chat	A note on classes of subgraphs of locally finite graphs	2023	Florian Lehner
+	Asymmetrizing infinite trees	2023	Wilfried Imrich Rafał Kalinowski Florian Lehner Monika Pilśniak Marcin Stawiski
+	Chromatic number is not tournament-local	2023	António Girão Kevin Hendrey Freddie Illingworth Florian Lehner Lukas Michel Michael Savery Raphael Steiner
+	Cop number of random k-uniform hypergraphs	2023	Joshua Erde Mihyun Kang Florian Lehner Bojan Mohar Dominik Schmid
+	Catching a robber on a random $k$-uniform hypergraph	2023	Joshua Erde Mihyun Kang Florian Lehner Bojan Mohar Dominik Schmid
+ PDF Chat	A Stallings type theorem for quasi-transitive graphs	2022	Matthias Hamann Florian Lehner Babak Miraftab Tim Rühmann
+ PDF Chat	Hamiltonian decompositions of 4‐regular Cayley graphs of infinite abelian groups	2022	Joshua Erde Florian Lehner
+ PDF Chat	Distinguishing infinite graphs with bounded degrees	2022	Florian Lehner Monika Pilśniak Marcin Stawiski
+	Universal planar graphs for the topological minor relation	2022	Florian Lehner
+	A note on classes of subgraphs of locally finite graphs	2022	Florian Lehner
+	Asymmetric colouring of locally compact permutation groups	2022	Florian Lehner
+	Tipsy cop and tipsy robber: collisions of biased random walks on graphs	2022	Pamela E. Harris Erik Insko Florian Lehner
+ PDF Chat	On the cop number of toroidal graphs	2021	Florian Lehner
+ PDF Chat	On fixity of arc-transitive graphs	2021	Florian Lehner Primož Potočnik Pablo Spiga
+ PDF Chat	Comparing consecutive letter counts in multiple context-free languages	2021	Florian Lehner Christian Lindorfer
+	Improved Bounds on the Cop Number of a Graph Drawn on a Surface	2021	Joshua Erde Florian Lehner
+ PDF Chat	Bounding the Cop Number of a Graph by Its Genus	2021	Nathan Bowler Joshua Erde Florian Lehner Max Pitz
+	Invariant spanning double rays in amenable groups	2020	Agelos Georgakopoulos Florian Lehner
+ PDF Chat	Distinguishing numbers of finite 4-valent vertex-transitive graphs	2020	Florian Lehner Gabriel Verret
+ PDF Chat	Counterexamples to “A conjecture on induced subgraphs of Cayley graphs”	2020	Florian Lehner Gabriel Verret
+	On fixity of arc-transitive graphs	2020	Florian Lehner Primož Potočnik Pablo Spiga
+	A bound for the distinguishing index of regular graphs	2020	Florian Lehner Monika Pilśniak Marcin Stawiski
+	On symmetries of edge and vertex colourings of graphs	2020	Florian Lehner Simon M. Smith
+	Distinguishing density and the Distinct Spheres Condition	2020	Wilfried Imrich Florian Lehner Simon M. Smith
+	Comparing consecutive letter counts in multiple context-free languages	2020	Florian Lehner Christian Lindorfer
+	Counterexamples to "A Conjecture on Induced Subgraphs of Cayley Graphs" [arXiv:2003.13166]	2020	Florian Lehner Gabriel Verret
+	Self-avoiding walks and multiple context-free languages	2020	Florian Lehner Christian Lindorfer
+	Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups	2020	Joshua Erde Florian Lehner
+	On fixity of arc-transitive graphs	2020	Florian Lehner Primož Potočnik Pablo Spiga
+	Comparing consecutive letter counts in multiple context-free languages	2020	Florian Lehner Christian Lindorfer
+	Bounding the cop number of a graph by its genus	2019	Nathan Bowler Joshua Erde Florian Lehner Max Pitz
+	Firefighting on trees and cayley graphs	2019	Florian Lehner
+	Bounding the cop number of a graph by its genus	2019	Joshua Erde Florian Lehner Max Pitz Nathan Bowler
+	Hamilton decompositions of one-ended Cayley graphs	2019	Joshua Erde Florian Lehner Max Pitz
+	On the cop number of toroidal graphs	2019	Florian Lehner
+	On asymmetric colourings of graphs with bounded degrees and infinite motion	2019	Florian Lehner Monika Pilśniak Marcin Stawiski
+	On the cop number of toroidal graphs	2019	Florian Lehner
+	Bounding the cop number of a graph by its genus	2019	Nathan Bowler Joshua Erde Florian Lehner Max Pitz
+	A Stallings' type theorem for quasi-transitive graphs	2018	Matthias Hamann Florian Lehner Babak Miraftab Tim Rühmann
+	Invariant spanning double rays in amenable groups	2018	Agelos Georgakopoulos Florian Lehner
+ PDF Chat	On tree‐decompositions of one‐ended graphs	2018	Johannes Carmesin Florian Lehner Rögnvaldur G. Möller
+	Trees with distinguishing index equal distinguishing number plus one	2018	‎Saeid Alikhani Sandi Klavžar Florian Lehner Samaneh Soltani
+	Distinguishing infinite graphs with bounded degrees	2018	Florian Lehner Monika Pilśniak Marcin Stawiski
+	Distinguishing numbers of finite $4$-valent vertex-transitive graphs	2018	Florian Lehner Gabriel Verret
+	On symmetries of edge and vertex colourings of graphs	2018	Florian Lehner Simon M. Smith
+	Non-reconstructible locally finite graphs	2018	Nathan Bowler Joshua Erde Peter Heinig Florian Lehner Max Pitz
+	Clique Trees of Infinite Locally Finite Chordal Graphs	2018	Christoph Hofer-Temmel Florian Lehner
+	Distinguishing density and the Distinct Spheres Condition	2018	Wilfried Imrich Florian Lehner Simon M. Smith
+	Invariant spanning double rays in amenable groups	2018	Agelos Georgakopoulos Florian Lehner
+	Distinguishing numbers of finite $4$-valent vertex-transitive graphs	2018	Florian Lehner Gabriel Verret
+	On symmetries of edge and vertex colourings of graphs	2018	Florian Lehner Simon Smith
+	Distinguishing density and the Distinct Spheres Condition	2018	Wilfried Imrich Florian Lehner Simon Smith
+	Distinguishing infinite graphs with bounded degrees	2018	Florian Lehner Monika Pilśniak Marcin Stawiski
+	A Stallings' type theorem for quasi-transitive graphs	2018	Matthias Hamann Florian Lehner Babak Miraftab Tim Rühmann
+	Hamilton decompositions of one-ended Cayley graphs	2017	Joshua Erde Florian Lehner Max Pitz
+	Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number	2017	Florian Lehner Stephan Wagner
+	Firefighting on trees and Cayley graphs	2017	Florian Lehner
+	On tree-decompositions of one-ended graphs	2017	Johannes Carmesin Florian Lehner Rögnvaldur G. Möller
+	Breaking graph symmetries by edge colourings	2017	Florian Lehner
+ PDF Chat	A counterexample to Montgomery’s conjecture on dynamic colourings of regular graphs	2017	Nathan Bowler Joshua Erde Florian Lehner Martin Merker Max Pitz Konstantinos S. Stavropoulos
+ PDF Chat	A counterexample to the reconstruction conjecture for locally finite trees	2017	Nathan Bowler Joshua Erde Peter Heinig Florian Lehner Max Pitz
+	A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs	2017	Nathan Bowler Joshua Erde Florian Lehner Martin Merker Max Pitz Konstantinos S. Stavropoulos
+	Firefighting on trees and Cayley graphs	2017	Florian Lehner
+	A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs	2017	Nathan Bowler Joshua Erde Florian Lehner Martin Merker Max Pitz Konstantinos Stavropoulos
+	Hamilton decompositions of one-ended Cayley graphs	2017	Joshua Erde Florian Lehner Max Pitz
+	On tree-decompositions of one-ended graphs	2017	Johannes Carmesin Florian Lehner Rögnvaldur G. Möller
+	Non-reconstructible locally finite graphs	2016	Nathan Bowler Joshua Erde Peter Heinig Florian Lehner Max Pitz
+	Trees with distinguishing index equal distinguishing number plus one	2016	‎Saeid Alikhani Sandi Klavžar Florian Lehner Samaneh Soltani
+ PDF Chat	Extending Cycles Locally to Hamilton Cycles	2016	Matthias Hamann Florian Lehner Julian Pott
+	Non-reconstructible locally finite graphs	2016	Nathan Bowler Joshua Erde Peter Heinig Florian Lehner Max Pitz
+	Trees with distinguishing index equal distinguishing number plus one	2016	‎Saeid Alikhani Sandi Klavžar Florian Lehner Samaneh Soltani
+	Breaking graph symmetries by edge colourings	2016	Florian Lehner
+ PDF Chat	Local Finiteness, Distinguishing Numbers, and Tucker's Conjecture	2015	Florian Lehner Rögnvaldur G. Möller
+ PDF Chat	The Cartesian product of graphs with loops	2015	Tetiana Boiko Johannes Cuno Wilfried Imrich Florian Lehner Christiaan E. van de Woestijne
+ PDF Chat	Distinguishing graphs with intermediate growth	2015	Florian Lehner
+	Fast Factorization of Cartesian products of Hypergraphs	2015	Marc Hellmuth Florian Lehner
+	Local finiteness, distinguishing numbers and Tucker's conjecture	2014	Florian Lehner Rögnvaldur G. Möller
+	Cops, robbers, and infinite graphs	2014	Florian Lehner
+ PDF Chat	Endomorphism Breaking in Graphs	2014	Wilfried Imrich Rafał Kalinowski Florian Lehner Monika Pilśniak
+	On spanning tree packings of highly edge connected graphs	2014	Florian Lehner
+	Symmetry breaking of graphs and groups	2014	Florian Lehner
+	Cops, robbers, and infinite graphs	2014	Florian Lehner
+	The Cartesian product of graphs with loops	2014	Tetiana Boiko Johannes Cuno Wilfried Imrich Florian Lehner Christiaan E. van de Woestijne
+	Local finiteness, distinguishing numbers and Tucker's conjecture	2014	Florian Lehner Rögnvaldur G. Möller
+	Clique trees of infinite locally finite chordal graphs	2013	Christoph Hofer-Temmel Florian Lehner
+	Endomorphism Breaking in Graphs	2013	Wilfried Imrich Rafał Kalinowski Florian Lehner Monika Pilśniak
+	Distinguishing graphs with infinite motion and nonlinear growth	2013	Johannes Cuno Wilfried Imrich Florian Lehner
+	Random Colourings and Automorphism Breaking in Locally Finite Graphs	2013	Florian Lehner
+	Random colorings and automorphism breaking in locally finite graphs	2013	Florian Lehner
+ PDF Chat	Distinguishing graphs with infinite motion and nonlinear growth	2013	Johannes Cuno Wilfried Imrich Florian Lehner
+	Distinguishing graphs with intermediate growth	2013	Florian Lehner
+	Distinguishing graphs with infinite motion and nonlinear growth	2013	Johannes Cuno Wilfried Imrich Florian Lehner
+	Random colorings and automorphism breaking in locally finite graphs	2013	Florian Lehner
+	Distinguishing graphs with intermediate growth	2013	Florian Lehner
+	Endomorphism Breaking in Graphs	2013	Wilfried Imrich Rafał Kalinowski Florian Lehner Monika Pilśniak
+	Clique trees of infinite locally finite chordal graphs	2013	Christoph Hofer-Temmel Florian Lehner
+	On spanning tree packings of highly edge connected graphs	2011	Florian Lehner
+	The Line Graph of Every Locally Finite 6-Edge-Connected Graph with Finitely Many Ends is Hamiltonian	2011	Florian Lehner
+	On spanning tree packings of highly edge connected graphs	2011	Florian Lehner
+	Free Cumulants and Enumeration of Connected Partitions	2002	Florian Lehner

Common Coauthors

Coauthor	Papers Together
Joshua Erde	20
Max Pitz	14
Wilfried Imrich	12
Nathan Bowler	11
Monika Pilśniak	10
Christian Lindorfer	7
Marcin Stawiski	7
Rögnvaldur G. Möller	6
Gabriel Verret	5
Johannes Cuno	5
Babak Miraftab	5
Rafał Kalinowski	4
Matthias Hamann	4
Simon M. Smith	4
Christoph Hofer-Temmel	3
Mihyun Kang	3
Bojan Mohar	3
Peter Heinig	3
Pablo Spiga	3
‎Saeid Alikhani	3
Johannes Carmesin	3
Tim Rühmann	3
Sandi Klavžar	3
Martin Merker	3
Agelos Georgakopoulos	3
Dominik Schmid	3
Primož Potočnik	3
Raphael Steiner	2
Pamela E. Harris	2
Erik Insko	2
Samaneh Soltani	2
Christiaan E. van de Woestijne	2
Kevin Hendrey	2
António Girão	2
Freddie Illingworth	2
Lukas Michel	2
Simon Smith	2
Michael Savery	2
Konstantinos S. Stavropoulos	2
Trent G. Marbach	1
Peter Heinig	1
JD Nir	1
Konstantinos Stavropoulos	1
Julian Pott	1
Stephan Wagner	1
Anthony Bonato	1
Marc Hellmuth	1
Farzad Maghsoudi	1
Samaneh Soltani	1
Oswin Aichholzer	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Distinguishing graphs with intermediate growth	2015	Florian Lehner	11
+ PDF Chat	Infinite motion and 2-distinguishability of graphs and groups	2014	Wilfried Imrich Simon M. Smith Thomas W. Tucker Mark E. Watkins	10
+	Random Colourings and Automorphism Breaking in Locally Finite Graphs	2013	Florian Lehner	8
+	A short note about pursuit games played on a graph with a given genus	1985	Alain Quilliot	8
+	Breaking graph symmetries by edge colourings	2017	Florian Lehner	8
+	Handbook of Product Graphs	2011	Richard H. Hammack Wilfried Imrich Sandi Klavžar	7
+ PDF Chat	Distinguishability of Infinite Groups and Graphs	2012	Simon M. Smith Thomas W. Tucker Mark E. Watkins	7
+ PDF Chat	A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces	2012	Nancy E. Clarke Samuel Fiorini Gwenaël Joret Dirk Oliver Theis	6
+ PDF Chat	Distinguishing graphs with infinite motion and nonlinear growth	2013	Johannes Cuno Wilfried Imrich Florian Lehner	5
+ PDF Chat	Meyniel’s conjecture on the cop number: A survey	2012	William Baird Anthony Bonato	5
+ PDF Chat	On Meyniel's conjecture of the cop number	2011	Linyuan Lü Xing Peng	5
+	On a pursuit game played on graphs for which a minor is excluded	1986	Thomas Andreae	5
+	The Hadwiger number of infinite vertex-transitive graphs	1992	Carsten Thomassen	4
+	On groups with no regular orbits on the set of subsets	1984	Peter J‎. Cameron Peter Neumann Jan Saxl	4
+	Automorphisms and endomorphisms of infinite locally finite graphs	1973	R. Halin	4
+	Quasi-isometries between graphs and trees	2008	Bernhard Krön Rögnvaldur G. Möller	4
+	Infinite Hamilton cycles in squares of locally finite graphs	2008	Agelos Georgakopoulos	4
+	Primitive Groups with no Regular Orbits on the Set of Subsets	1997	Ákos Seress	4
+	The Copnumber of a Graph is Bounded by [3/2 genus (G)] + 3	2001	Bernd S. W. Schröder	4
+ PDF Chat	Oligomorphic Permutation Groups	1990	Peter J‎. Cameron	4
+	Asymmetric trees with two prescribed degrees	1977	László Babai	4
+ PDF Chat	Distinguishing Graphs of Maximum Valence 3	2019	Svenja Hüning Wilfried Imrich Judith Kloas Hannah Schreber Thomas W. Tucker	4
+ PDF Chat	Motion and distinguishing number two	2011	Marston Conder Thomas W. Tucker	4
+	Locally finite graphs with ends: A topological approach, I. Basic theory	2010	Reinhard Diestel	4
+	Supereulerian graphs: A survey	1992	Paul A. Catlin	3
+ PDF Chat	Topological directions in Cops and Robbers	2019	Anthony Bonato Bojan Mohar	3
+	Cops and robbers in a random graph	2012	Béla Bollobás Gábor Kun Imre Leader	3
+ PDF Chat	Improving upper bounds for the distinguishing index	2017	Monika Pilśniak	3
+	Notes on Cops and Robber game on graphs	2017	Bojan Mohar	3
+	On the hamiltonicity of line graphs of locally finite, 6‐edge‐connected graphs	2011	Richard C. Brewster Daryl Funk	3
+	Vertex Cuts	2014	M. J. Dunwoody Bernhard Krön	3
+	Graph Isomorphism in Quasipolynomial Time	2015	László Babai	3
+	Abelian groups	1960	L. Fuchs	3
+	On the reconstruction of locally finite trees	1981	Thomas Andreae	3
+ PDF Chat	Variations on cops and robbers	2011	Alan Frieze Michael Krivelevich Po‐Shen Loh	3
+	On end degrees and infinite cycles in locally finite graphs	2007	Henning Bruhn Maya Stein	3
+	Reconstructing 1-coherent locally finite trees	1978	Carsten Thomassen	3
+	The structure of rayless graphs	1998	R. Halin	3
+	A note on graphs with countable automorphism group	2000	R. Halin	3
+	Topological paths, cycles and spanning trees in infinite graphs	2004	Reinhard Diestel Daniela Kühn	3
+	Hamiltonian Paths in Squares of Infinite Locally Finite Blocks	1978	Carsten Thomassen	3
+	Graph reconstruction—a survey	1977	J. A. Bondy Robert L. Hemminger	3
+	Hamilton decompositions of certain 6-regular Cayley graphs on Abelian groups with a cyclic subgroup of index two	2012	Erik E. Westlund	3
+	Hamiltonian decompositions of Cayley graphs on Abelian groups	1994	Jiuqiang Liu	3
+	Cutting up graphs	1982	M. J. Dunwoody	3
+	Abelian groups, graphs and generalized knights	1959	C. St. J. A. Nash‐Williams	3
+ PDF Chat	Meyniel's conjecture holds for random graphs	2015	Paweł Prałat Nicholas Wormald	3
+	Hamiltonian decomposition of Cayley graphs of degree 4	1989	J.-C. Bermond Odile Favaron Maryvonne Mahéo	3
+ PDF Chat	On Eulerian and Hamiltonian Graphs and Line Graphs	1965	Frank Harary C. St. J. A. Nash‐Williams	3
+	Probability on Trees and Networks	2016	Russell Lyons Yuval Peres	3