×

zbMATH — the first resource for mathematics

Lehner, Florian

Compute Distance To:
Author ID: lehner.florian Recent zbMATH articles by "Lehner, Florian"
Published as: Lehner, F.; Lehner, Florian
Documents Indexed: 30 Publications since 2001

Publications by Year

Citations contained in zbMATH Open

20 Publications have been cited 52 times in 38 Documents Cited by Year
Distinguishing graphs with intermediate growth. Zbl 1389.05070
Lehner, Florian
7
2016
Extending cycles locally to Hamilton cycles. Zbl 1335.05122
Hamann, Matthias; Lehner, Florian; Pott, Julian
6
2016
Breaking graph symmetries by edge colourings. Zbl 1371.05087
Lehner, Florian
5
2017
A counterexample to montgomery’s conjecture on dynamic colourings of regular graphs. Zbl 1367.05068
Bowler, N.; Erde, J.; Lehner, F.; Merker, M.; Pitz, M.; Stavropoulos, K.
5
2017
Random colourings and automorphism breaking in locally finite graphs. Zbl 1282.05043
Lehner, Florian
5
2013
Distinguishing graphs with infinite motion and nonlinear growth. Zbl 1301.05369
Cuno, Johannes; Imrich, Wilfried; Lehner, Florian
4
2014
On spanning tree packings of highly edge connected graphs. Zbl 1300.05256
Lehner, Florian
4
2014
The Cartesian product of graphs with loops. Zbl 1351.05192
Boiko, Tetiana; Cuno, Johannes; Imrich, Wilfried; Lehner, Florian; van de Woestijne, Christiaan E.
2
2016
Endomorphism breaking in graphs. Zbl 1300.05100
Imrich, Wilfried; Kalinowski, Rafał; Lehner, Florian; Pilśniak, Monika
2
2014
Freeness of linear and quadratic forms in von Neumann algebras. Zbl 1373.46061
Chistyakov, G. P.; Götze, F.; Lehner, F.
2
2011
A bound for the distinguishing index of regular graphs. Zbl 1447.05087
Lehner, Florian; Pilśniak, Monika; Stawiski, Marcin
1
2020
On symmetries of edge and vertex colourings of graphs. Zbl 1443.05071
Lehner, Florian; Smith, Simon M.
1
2020
Trees with distinguishing index equal distinguishing number plus one. Zbl 1439.05075
Alikhani, Saeid; Klavžar, Sandi; Lehner, Florian; Soltani, Samaneh
1
2020
Hamilton decompositions of one-ended Cayley graphs. Zbl 1430.05049
Erde, Joshua; Lehner, Florian; Pitz, Max
1
2020
Firefighting on trees and Cayley graphs. Zbl 1429.05090
Lehner, Florian
1
2019
Clique trees of infinite locally finite chordal graphs. Zbl 1391.05186
Hofer-Temmel, Christoph; Lehner, Florian
1
2018
A counterexample to the reconstruction conjecture for locally finite trees. Zbl 1370.05153
Bowler, Nathan; Erde, Joshua; Heinig, Peter; Lehner, Florian; Pitz, Max
1
2017
Fast factorization of Cartesian products of (directed) hypergraphs. Zbl 1334.05167
Hellmuth, Marc; Lehner, Florian
1
2016
Local finiteness, distinguishing numbers, and Tucker’s conjecture. Zbl 1323.05050
Lehner, Florian; Möller, Rögnvaldur G.
1
2015
On modelling of “winged” cracks forming under compression. Zbl 1066.74052
Lehner, Florian; Kachanov, Mark
1
2001
A bound for the distinguishing index of regular graphs. Zbl 1447.05087
Lehner, Florian; Pilśniak, Monika; Stawiski, Marcin
1
2020
On symmetries of edge and vertex colourings of graphs. Zbl 1443.05071
Lehner, Florian; Smith, Simon M.
1
2020
Trees with distinguishing index equal distinguishing number plus one. Zbl 1439.05075
Alikhani, Saeid; Klavžar, Sandi; Lehner, Florian; Soltani, Samaneh
1
2020
Hamilton decompositions of one-ended Cayley graphs. Zbl 1430.05049
Erde, Joshua; Lehner, Florian; Pitz, Max
1
2020
Firefighting on trees and Cayley graphs. Zbl 1429.05090
Lehner, Florian
1
2019
Clique trees of infinite locally finite chordal graphs. Zbl 1391.05186
Hofer-Temmel, Christoph; Lehner, Florian
1
2018
Breaking graph symmetries by edge colourings. Zbl 1371.05087
Lehner, Florian
5
2017
A counterexample to montgomery’s conjecture on dynamic colourings of regular graphs. Zbl 1367.05068
Bowler, N.; Erde, J.; Lehner, F.; Merker, M.; Pitz, M.; Stavropoulos, K.
5
2017
A counterexample to the reconstruction conjecture for locally finite trees. Zbl 1370.05153
Bowler, Nathan; Erde, Joshua; Heinig, Peter; Lehner, Florian; Pitz, Max
1
2017
Distinguishing graphs with intermediate growth. Zbl 1389.05070
Lehner, Florian
7
2016
Extending cycles locally to Hamilton cycles. Zbl 1335.05122
Hamann, Matthias; Lehner, Florian; Pott, Julian
6
2016
The Cartesian product of graphs with loops. Zbl 1351.05192
Boiko, Tetiana; Cuno, Johannes; Imrich, Wilfried; Lehner, Florian; van de Woestijne, Christiaan E.
2
2016
Fast factorization of Cartesian products of (directed) hypergraphs. Zbl 1334.05167
Hellmuth, Marc; Lehner, Florian
1
2016
Local finiteness, distinguishing numbers, and Tucker’s conjecture. Zbl 1323.05050
Lehner, Florian; Möller, Rögnvaldur G.
1
2015
Distinguishing graphs with infinite motion and nonlinear growth. Zbl 1301.05369
Cuno, Johannes; Imrich, Wilfried; Lehner, Florian
4
2014
On spanning tree packings of highly edge connected graphs. Zbl 1300.05256
Lehner, Florian
4
2014
Endomorphism breaking in graphs. Zbl 1300.05100
Imrich, Wilfried; Kalinowski, Rafał; Lehner, Florian; Pilśniak, Monika
2
2014
Random colourings and automorphism breaking in locally finite graphs. Zbl 1282.05043
Lehner, Florian
5
2013
Freeness of linear and quadratic forms in von Neumann algebras. Zbl 1373.46061
Chistyakov, G. P.; Götze, F.; Lehner, F.
2
2011
On modelling of “winged” cracks forming under compression. Zbl 1066.74052
Lehner, Florian; Kachanov, Mark
1
2001

Citations by Year