Author

Lehner F

University of Auckland - Cited by 306

Biography

Lehner F is currently working as a Professor in the Department of General, Visceral and Transplant Surgery. His research interests includes Surgery. He is serving as an editorial member and reviewer of several international reputed journals. He has successfully completed his Administrative responsibilities. Lehner F has authored of many research articles/books related to Surgery.  
Title
Cited by
Year
Distinguishing graphs with intermediate growth
F LehnerCombinatorica 36 (3), 333-347, 2016201
27
2016
Breaking graph symmetries by edge colourings
F LehnerJournal of Combinatorial Theory, Series B 127, 205-4, 2017201
21
2017
On the cop number of toroidal graphs
F LehnerJournal of Combinatorial Theory, Series B 151, 250-262, 2021202
19
2021
Bounding the cop number of a graph by its genus
N Bowler, J Erde, F Lehner, M PitzSIAM Journal on Discrete Mathematics 35 (4), 2459-2489, 2021202
19
2021
Extending cycles locally to Hamilton cycles
M Hamann, F Lehner, J PottThe Electronic Journal of Combinatorics, P1. 49-P1. 49, 2016201
18
2016
On spanning tree packings of highly edge connected graphs
F LehnerJournal of Combinatorial Theory, Series B 105, 93-126, 2014201
15
2014
Distinguishing graphs with infinite motion and nonlinear growth
J Cuno, W Imrich, F LehnerarXiv preprint arXiv:11.4372, 202
13
2013
Endomorphism breaking in graphs
W Imrich, R Kalinowski, F Lehner, M PilśniakarXiv preprint arXiv:11.6972, 202
13
2013
A bound for the distinguishing index of regular graphs
F Lehner, M Pilśniak, M StawiskiEuropean Journal of Combinatorics 89, 103145, 2020202
13
2020
Pursuit evasion on infinite graphs
F LehnerTheoretical Computer Science 655, 30-40, 201612201
12
2016
Random colourings and automorphism breaking in locally finite graphs
F LehnerCombinatorics, Probability and Computing 22 (6), 885-909, 2013201
11
2013
A counterexample to Montgomery’s conjecture on dynamic colourings of regular graphs
N Bowler, J Erde, F Lehner, M Merker, M Pitz, K StavropoulosDiscrete Applied Mathematics 229, 151-153, 2017201
11
2017
On symmetries of edge and vertex colourings of graphs
F Lehner, SM SmithDiscrete Mathematics 343 (9), 1959, 2020202
11
2020
Firefighting on trees and Cayley graphs
F LehnerarXiv preprint arXiv:1707.01224, 2017201
8
2017
Hamilton decompositions of one-ended Cayley graphs
J Erde, F Lehner, M PitzJournal of Combinatorial Theory, Series B 140, 171-191, 2020202
8
2020
A counterexample to the reconstruction conjecture for locally finite trees
N Bowler, J Erde, P Heinig, F Lehner, M PitzBulletin of the London Mathematical Society 49 (4), 630-648, 20120
7
2017
Trees with distinguishing index equal distinguishing number plus one
S Alikhani, S Klavžar, F Lehner, S SoltaniDiscussiones Mathematicae Graph Theory 40 (3), 875-884, 2020202
6
2020
Distinguishing density and the distinct spheres condition
W Imrich, F Lehner, SM SmithEuropean journal of combinatorics 89, 103139, 2020202
5
2020
Distinguishing infinite graphs with bounded degrees
F Lehner, M Pilśniak, M StawiskiarXiv preprint arXiv:1810.03932, 2018201
5
2018
Non-reconstructible locally finite graphs
N Bowler, J Erde, P Heinig, F Lehner, M PitzJournal of Combinatorial Theory, Series B 133, 122-12, 2018201
5
2018

Referred From: https://scholar.google.com/citations?hl=en&user=BPBW2x0AAAAJ

Cited by
Citations 306
h-index 11
i10-index 14
Recommended Journals
Open Access Journals