default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Lehner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Florian Lehner:
Universal Planar Graphs for the Topological Minor Relation. Comb. 44(1): 209-230 (2024)- [j34]António Girão, Kevin Hendrey, Freddie Illingworth
, Florian Lehner, Lukas Michel, Michael Savery, Raphael Steiner:
Chromatic number is not tournament-local. J. Comb. Theory B 168: 86-95 (2024) - [j33]Pamela E. Harris, Erik Insko, Florian Lehner:
Tipsy cop and tipsy robber: Collisions of biased random walks on graphs. Theor. Comput. Sci. 997: 114512 (2024) - [i4]Oswin Aichholzer, Florian Lehner, Christian Lindorfer:
Folding polyominoes into cubes. CoRR abs/2402.14965 (2024) - 2023
- [j32]Florian Lehner:
A note on classes of subgraphs of locally finite graphs. J. Comb. Theory B 161: 52-62 (2023) - 2022
- [j31]Florian Lehner, Monika Pilsniak, Marcin Stawiski:
Corrigendum to "A bound for the distinguishing index of regular graphs" [European J. Combin. 89 (2020) 103145]. Eur. J. Comb. 101: 103489 (2022) - [j30]Matthias Hamann, Florian Lehner, Babak Miraftab, Tim Rühmann:
A Stallings type theorem for quasi-transitive graphs. J. Comb. Theory B 157: 40-69 (2022) - [j29]Florian Lehner, Monika Pilsniak, Marcin Stawiski:
Distinguishing infinite graphs with bounded degrees. J. Graph Theory 101(1): 52-65 (2022) - [j28]Joshua Erde, Florian Lehner:
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups. J. Graph Theory 101(3): 559-571 (2022) - 2021
- [j27]Agelos Georgakopoulos, Florian Lehner:
Invariant spanning double rays in amenable groups. Discret. Math. 344(2): 112207 (2021) - [j26]Florian Lehner:
On the cop number of toroidal graphs. J. Comb. Theory B 151: 250-262 (2021) - [j25]Nathan J. Bowler, Joshua Erde, Florian Lehner, Max Pitz:
Bounding the Cop Number of a Graph by Its Genus. SIAM J. Discret. Math. 35(4): 2459-2489 (2021) - [j24]Florian Lehner, Christian Lindorfer:
Comparing consecutive letter counts in multiple context-free languages. Theor. Comput. Sci. 868: 1-5 (2021) - 2020
- [j23]Florian Lehner, Gabriel Verret:
Counterexamples to "A conjecture on induced subgraphs of Cayley graphs". Ars Math. Contemp. 19(1): 77-82 (2020) - [j22]Florian Lehner, Gabriel Verret:
Distinguishing numbers of finite 4-valent vertex-transitive graphs. Ars Math. Contemp. 19(2): 173-187 (2020) - [j21]Florian Lehner, Simon M. Smith:
On symmetries of edge and vertex colourings of graphs. Discret. Math. 343(9): 111959 (2020) - [j20]Saeid Alikhani, Sandi Klavzar, Florian Lehner, Samaneh Soltani:
Trees with distinguishing index equal distinguishing number plus one. Discuss. Math. Graph Theory 40(3): 875-884 (2020) - [j19]Wilfried Imrich, Florian Lehner, Simon M. Smith:
Distinguishing density and the Distinct Spheres Condition. Eur. J. Comb. 89: 103139 (2020) - [j18]Florian Lehner, Monika Pilsniak, Marcin Stawiski:
A bound for the distinguishing index of regular graphs. Eur. J. Comb. 89: 103145 (2020) - [j17]Joshua Erde, Florian Lehner, Max Pitz:
Hamilton decompositions of one-ended Cayley graphs. J. Comb. Theory, Ser. B 140: 171-191 (2020) - [i3]Florian Lehner, Christian Lindorfer:
Comparing consecutive letter counts in multiple context-free languages. CoRR abs/2002.08236 (2020) - [i2]Florian Lehner, Christian Lindorfer:
Self-avoiding walks and multiple context-free languages. CoRR abs/2010.06974 (2020)
2010 – 2019
- 2019
- [j16]Florian Lehner:
Firefighting on trees and Cayley graphs. Australas. J Comb. 75: 66-72 (2019) - 2018
- [j15]Christoph Hofer-Temmel, Florian Lehner:
Clique Trees of Infinite Locally Finite Chordal Graphs. Electron. J. Comb. 25(2): 2 (2018) - [j14]Nathan J. Bowler, Joshua Erde, Peter Heinig, Florian Lehner, Max Pitz:
Non-reconstructible locally finite graphs. J. Comb. Theory B 133: 122-152 (2018) - 2017
- [j13]Nathan J. Bowler, Joshua Erde, Florian Lehner, Martin Merker, Max Pitz, Konstantinos S. Stavropoulos:
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. Discret. Appl. Math. 229: 151-153 (2017) - [j12]Florian Lehner, Stephan Wagner:
Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number. Graphs Comb. 33(5): 1103-1118 (2017) - [j11]Florian Lehner:
Breaking graph symmetries by edge colourings. J. Comb. Theory B 127: 205-214 (2017) - [c1]Florian Lehner, Wojciech Mazurczyk, Jörg Keller, Steffen Wendzel:
Inter-Protocol Steganography for Real-Time Services and Its Detection Using Traffic Coloring Approach. LCN 2017: 78-85 - 2016
- [j10]Tetiana Boiko, Johannes Cuno, Wilfried Imrich, Florian Lehner, Christiaan E. van de Woestijne:
The Cartesian product of graphs with loops. Ars Math. Contemp. 11(1): 1-9 (2016) - [j9]Florian Lehner:
Distinguishing graphs with intermediate growth. Comb. 36(3): 333-347 (2016) - [j8]Matthias Hamann, Florian Lehner, Julian Pott:
Extending Cycles Locally to Hamilton Cycles. Electron. J. Comb. 23(1): 1 (2016) - [j7]Marc Hellmuth, Florian Lehner:
Fast factorization of Cartesian products of (directed) hypergraphs. Theor. Comput. Sci. 615: 1-11 (2016) - [j6]Florian Lehner:
Pursuit evasion on infinite graphs. Theor. Comput. Sci. 655: 30-40 (2016) - 2015
- [j5]Florian Lehner, Rögnvaldur G. Möller:
Local Finiteness, Distinguishing Numbers, and Tucker's Conjecture. Electron. J. Comb. 22(4): 4 (2015) - [i1]Marc Hellmuth, Florian Lehner:
Fast Factorization of Cartesian products of Hypergraphs. CoRR abs/1508.07181 (2015) - 2014
- [j4]Johannes Cuno, Wilfried Imrich, Florian Lehner:
Distinguishing graphs with infinite motion and nonlinear growth. Ars Math. Contemp. 7(1): 201-213 (2014) - [j3]Wilfried Imrich, Rafal Kalinowski, Florian Lehner, Monika Pilsniak:
Endomorphism Breaking in Graphs. Electron. J. Comb. 21(1): 1 (2014) - [j2]Florian Lehner:
On spanning tree packings of highly edge connected graphs. J. Comb. Theory B 105: 93-126 (2014) - 2013
- [j1]Florian Lehner:
Random Colourings and Automorphism Breaking in Locally Finite Graphs. Comb. Probab. Comput. 22(6): 885-909 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
