Florian Lehner

Research output

Research output per year 2011 2014 2016 2019 2020 2021 2022 2023

• 29 Article
• 5 Preprint
• 2 Conference paper
• 1 Comment/debate
• 3 More
  • 1 Diploma Thesis
  • 1 Doctoral Thesis
  • 1 Working paper

Research output per year

Research output per year

Search results

• 2023

  Self-avoiding walks and multiple context-free languages

  Lehner, F. & Lindorfer, C., 2023, In: Combinatorial Theory. 3, 1, 52 p., #18.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Edge 100%
  • Cayley Graph 50%
  • Finitely generated group 33%
  • Generating Function 33%
  • Connected Graph 33%
• 2022

  A note on classes of subgraphs of locally finite graphs

  Lehner, F., 25 May 2022.

  Research output: Working paper › Preprint

  File

  • Finite Graph 100%
  • Necessary and Sufficient Condition 33%
  • Maximum Degree 33%
  • Induced Subgraph 33%

• A Stallings type theorem for quasi-transitive graphs

  Hamann, M., Lehner, F., Miraftab, B. & Rühmann, T., Nov 2022, In: Journal of Combinatorial Theory. Series B. 157, p. 40-69 30 p.

  Research output: Contribution to journal › Article › peer-review

  • Finitely generated group 100%
  • Planar Graph 100%

• Asymmetric colouring of locally compact permutation groups

  Lehner, F., 18 Aug 2022.

  Research output: Working paper › Preprint

  File

  • Asymmetric 100%
  • Permutation Group 100%
  • Minimal Number 33%
  • Countable Set 33%

• Corrigendum to “A bound for the distinguishing index of regular graphs”: “A bound for the distinguishing index of regular graphs” (European Journal of Combinatorics (2020) 89, (103145), (S0195669820300664), (10.1016/j.ejc.2020.103145))

  Lehner, F., Pilśniak, M. & Stawiski, M., Mar 2022, In: European Journal of Combinatorics. 101, 103489.

  Research output: Contribution to journal › Comment/debate › peer-review

  Open Access

  • Combinatorics 100%
  • Regular Graph 100%
  • Edge 50%

• Distinguishing infinite graphs with bounded degrees

  Lehner, F., Pilsniak, M. & Stawiski, M., Sept 2022, In: Journal of Graph Theory. 101, 1, p. 52-65 14 p.

  Research output: Contribution to journal › Article › peer-review

  • Maximum Degree 100%
  • Connected Graph 50%
  • Automorphism 50%
  • Preserving Automorphism 50%

• Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups

  Erde, J. & Lehner, F., Nov 2022, In: Journal of Graph Theory. 101, 3, p. 559-571 13 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Cayley Graph 100%
  • Abelian Group 100%
  • Hamiltonian Cycle 75%
  • Circle 50%
  • Finite Abelian Group 25%

• Tipsy cop and tipsy robber: collisions of biased random walks on graphs

  Harris, P. E., Insko, E. & Lehner, F., 26 Aug 2022.

  Research output: Working paper › Preprint

  File

  • Regular Tree 100%
  • Random Walk 100%
  • Concludes 50%

• Universal planar graphs for the topological minor relation

  Lehner, F., 7 Mar 2022.

  Research output: Working paper › Preprint

  File

  • Planar Graph 100%
  • Complete Graph 25%
• 2021

  Bounding the cop number of a graph by its genus

  Bowler, N., Erde, J., Lehner, F. & Pitz, M., 19 Nov 2021, In: SIAM Journal on Discrete Mathematics. 35, 4, p. 2459-2489 31 p.

  Research output: Contribution to journal › Article › peer-review

  • Connected Graph 100%

• Comparing consecutive letter counts in multiple context-free languages

  Lehner, F. & Lindorfer, C., 8 May 2021, In: Theoretical Computer Science. 868, p. 1-5 5 p.

  Research output: Contribution to journal › Article › peer-review

  • context-free language 100%
  • Context-Free Grammars 100%

• Improved Bounds on the Cop Number of a Graph Drawn on a Surface

  Erde, J. & Lehner, F., 2021, Trends in Mathematics: Extended Abstracts EuroComb 2021. Springer, Vol. 14. p. 111-116 6 p. (Trends in Mathematics; vol. 14).

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • Connected Graph 100%
  • Topological Game 100%

• Invariant spanning double rays in amenable groups

  Georgakopoulos, A. & Lehner, F., Feb 2021, In: Discrete Mathematics. 344, 2, 112207.

  Research output: Contribution to journal › Article › peer-review

  • Cayley Graph 100%
  • Benjamini 100%
  • Amenable Group 100%
  • Spanning Tree 100%

• On fixity of arc-transitive graphs

  Lehner, F., Potočnik, P. & Spiga, P., Dec 2021, In: Science China / Mathematics. 64, 12, p. 2603-2610 8 p.

  Research output: Contribution to journal › Article › peer-review

  • Permutation Group 100%
  • Automorphism Group 33%
  • Fixed Points 33%

• On the cop number of toroidal graphs

  Lehner, F., 2021, In: Journal of Combinatorial Theory, Series B. 151, p. 250-262 13 p.

  Research output: Contribution to journal › Article › peer-review
• 2020

  A bound for the distinguishing index of regular graphs

  Lehner, F., Pilsniak, M. & Stawiski, M., Oct 2020, In: European Journal of Combinatorics. 89, 9 p., 103145.

  Research output: Contribution to journal › Article › peer-review

  • Edge 100%
  • Regular Graph 100%
  • Finite Graph 25%
  • Automorphism 25%
  • Infinite Cardinal 25%

• Counterexamples to "A Conjecture on Induced Subgraphs of Cayley Graphs''

  Lehner, F. & Verret, G., 1 Jan 2020, In: Ars Mathematica Contemporanea. 19, 1, p. 77-82 6 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Cayley Graph 100%
  • Counterexample 100%
  • Induced Subgraph 100%
  • Hypercube 40%
  • Analogous Result 20%

• Distinguishing density and the Distinct Spheres Condition

  Imrich, W., Lehner, F. & Smith, S. M., 2020, In: European Journal of Combinatorics. 89, 10 p., 103139.

  Research output: Contribution to journal › Article › peer-review

  • Automorphism 100%
  • Finite Graph 50%

• Distinguishing numbers of finite 4-valent vertex-transitive graphs

  Lehner, F. & Verret, G., 1 Jan 2020, In: Ars Mathematica Contemporanea. 19, 2, p. 173-187 15 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Preserving Automorphism 100%

• Hamilton decompositions of one-ended Cayley graphs

  Erde, J., Lehner, F. & Pitz, M., Jan 2020, In: Journal of Combinatorial Theory, Series B. 140, p. 171-191 21 p.

  Research output: Contribution to journal › Article › peer-review

  • Edge 100%
  • Cayley Graph 100%
  • Generating Set 50%
  • Abelian Group 50%

• On symmetries of edge and vertex colourings of graphs

  Lehner, F. & Smith, S. M., 2020, In: Discrete Mathematics. 343, 9, 8 p., 111959.

  Research output: Contribution to journal › Article › peer-review

• Self-avoiding walks and multiple context-free languages

  Lehner, F. & Lindorfer, C., 14 Oct 2020.

  Research output: Working paper › Preprint

  File

• Trees with distinguishing index equal distinguishing number plus one

  Alikhani, S., Klavžar, S., Lehner, F. & Soltani, S., 2020, In: Discussiones Mathematicae Graph Theory. 40, 3, p. 875-884 10 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Edge 100%
  • Automorphism 100%
  • Index Number 100%
• 2019

  Bounding the cop number of a graph by its genus

  Erde, J., Lehner, F., Pitz, M. & Bowler, N., 2019, Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2019). p. 507-510 (Acta Mathematica Universitatis Comenianae).

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • Edge 100%
  • Orientable Surface 100%
  • Topological Game 100%
  • Surface (Surface Science) 100%

• Firefighting on trees and cayley graphs

  Lehner, F., 1 Oct 2019, In: Australasian Journal of Combinatorics. 75, 1, p. 66-72 7 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

• On asymmetric colourings of graphs with bounded degrees and infinite motion

  Lehner, F., Pilśniak, M. & Stawiski, M., 5 Dec 2019.

  Research output: Working paper

  File

  • Asymmetric 100%
  • Automorphism 75%
  • Finite Graph 25%
  • Connected Graph 25%

• On tree-decompositions of one-ended graphs

  Carmesin, J., Lehner, F. & Möller, R. G., Mar 2019, In: Mathematische Nachrichten. 292, 3, p. 524-539 16 p.

  Research output: Contribution to journal › Article › peer-review

  • Pairwise Disjoint 100%
  • Finite Number 50%
  • Dominates 50%
  • Automorphism 50%
  • Automorphism Group 50%
• 2018

  Clique trees of infinite locally finite chordal graphs

  Hofer-Temmel, C. & Lehner, F., 2018, In: The Electronic Journal of Combinatorics . 25, 2, P2.9.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Clique 100%
  • Edge 33%
  • Bijection 33%
  • Finite Family 16%
• 2017

  Maximising the number of independent sets in connected graphs

  Lehner, F. & Wagner, S., 2017, In: Graphs and Combinatorics. 33, 5, p. 1103-1118 16 p.

  Research output: Contribution to journal › Article › peer-review

  • Connected Graph 100%
  • Independent Set 100%
  • Clique 75%
  • Maximum Independent Set 25%
  • Edge 25%
• 2016

  Distinguishing graphs with intermediate growth

  Lehner, F., 2016, In: Combinatorica. 36, 3, p. 333-347 15 p.

  Research output: Contribution to journal › Article › peer-review

• Extending cycles locally to Hamilton cycles

  Hamann, M., Lehner, F. & Pott, J., 2016, In: The Electronic Journal of Combinatorics . 23, 1, 17 p., P1.49.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Circle 100%
  • Free Graph 50%
  • Unit Interval 50%
  • Unit Circle 50%

• Pursuit evasion on infinite graphs

  Lehner, F., 2016, In: Theoretical Computer Science. 655, Part A, p. 30-40 11 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Finite Graph 100%
  • Finiteness 50%
  • Edge of a Graph 50%
  • Winning Strategy 50%
  • Finite Case 50%

• The Cartesian product of graphs with loops

  Boiko, T., Cuno, J., Imrich, W., Lehner, F. & Woestijne, C. E. V. D., 2016, In: Ars Mathematica Contemporanea. 11, 1, p. 1-9 9 p.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Cartesian Product 100%
  • Edge 50%
  • Factorization 50%
  • Finite Graph 50%
  • Factorization Theorem 50%
• 2015

  Local finiteness, distinguishing numbers and Tucker's conjecture

  Lehner, F. & Möller, R. G., 2015, In: The Electronic Journal of Combinatorics . 22, 4, p. 1-5

  Research output: Contribution to journal › Article › peer-review
• 2014

  Distinguishing graphs with infinite motion and nonlinear growth

  Cuno, J., Imrich, W. & Lehner, F., 2014, In: Ars Mathematica Contemporanea. 7, 1, p. 201-213

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Automorphism 100%
  • Cardinality 100%
  • Connected Graph 50%
  • Automorphism Group 50%

• Endomorphism Breaking in Graphs

  Imrich, W., Kalinowski, R., Lehner, F. & Pilśniak, M., 2014, In: The Electronic Journal of Combinatorics . 21, 1, 13 p., P1.16.

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Endomorphism 100%
  • Automorphism 25%

• On spanning tree packings of highly edge connected graphs

  Lehner, F., 2014, In: Journal of Combinatorial Theory, Series B. 105, p. 93-126

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Edge 100%
  • Connected Graph 100%
  • Spanning Tree 100%
  • Finite Graph 50%
  • Line Graph 50%

• Symmetry breaking of graphs and groups

  Lehner, F., 2014

  Research output: Thesis › Doctoral Thesis
• 2013

  Random colorings and automorphism breaking in locally finite graphs

  Lehner, F., 2013, In: Combinatorics, Probability & Computing. 22, 6, p. 885-909

  Research output: Contribution to journal › Article › peer-review

  • Finite Graph 100%
  • Automorphism 100%
  • Stabilizer 50%
  • Automorphism Group 25%
  • Haar Measure 25%
• 2011

  The line graph of every locally finite 6-edge-connected graph with finitely many ends is hamiltonian

  Lehner, F., 2011

  Research output: Thesis › Diploma Thesis