Florian Lehner

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Bounding the cop number of a graph by its genus
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Improved bounds on the cop number of a graph drawn on a surface2024-09-13Paper
Chromatic number is not tournament-local
Journal of Combinatorial Theory. Series B
2024-07-01Paper
Tipsy cop and tipsy robber: collisions of biased random walks on graphs
Theoretical Computer Science
2024-04-16Paper
Universal planar graphs for the topological minor relation
Combinatorica
2024-04-09Paper
Distinguishing infinite graphs with bounded degrees
Journal of Graph Theory
2023-10-05Paper
Hamiltonian decompositions of 4‐regular Cayley graphs of infinite abelian groups
Journal of Graph Theory
2023-10-05Paper
Asymmetric colouring of locally compact permutation groups
Bulletin of the London Mathematical Society
2023-09-15Paper
Chromatic number is not tournament-local2023-05-24Paper
A note on classes of subgraphs of locally finite graphs
Journal of Combinatorial Theory. Series B
2023-05-02Paper
Self-avoiding walks and multiple context-free languages
Combinatorial Theory
2023-03-31Paper
Asymmetrizing infinite trees2023-01-24Paper
A Stallings type theorem for quasi-transitive graphs
Journal of Combinatorial Theory. Series B
2022-09-23Paper
Corrigendum to: ``A bound for the distinguishing index of regular graphs
European Journal of Combinatorics
2022-01-13Paper
On fixity of arc-transitive graphs
Science China. Mathematics
2021-12-14Paper
Bounding the cop number of a graph by its genus
SIAM Journal on Discrete Mathematics
2021-11-04Paper
On the cop number of toroidal graphs
Journal of Combinatorial Theory. Series B
2021-09-16Paper
Distinguishing numbers of finite 4-valent vertex-transitive graphs
Ars Mathematica Contemporanea
2021-06-11Paper
Counterexamples to ``A conjecture on induced subgraphs of Cayley graphs
Ars Mathematica Contemporanea
2021-06-11Paper
Comparing consecutive letter counts in multiple context-free languages
Theoretical Computer Science
2021-05-10Paper
Invariant spanning double rays in amenable groups
Discrete Mathematics
2020-12-04Paper
A bound for the distinguishing index of regular graphs
European Journal of Combinatorics
2020-09-15Paper
Distinguishing density and the distinct spheres condition
European Journal of Combinatorics
2020-09-15Paper
On symmetries of edge and vertex colourings of graphs
Discrete Mathematics
2020-07-08Paper
On fixity of arc-transitive graphs
(available as arXiv preprint)
2020-05-25Paper
Trees with distinguishing index equal distinguishing number plus one
Discussiones Mathematicae Graph Theory
2020-04-28Paper
Hamilton decompositions of one-ended Cayley graphs
Journal of Combinatorial Theory. Series B
2020-01-15Paper
Firefighting on trees and Cayley graphs2019-12-19Paper
Firefighting on trees and Cayley graphs
(available as arXiv preprint)
2019-12-19Paper
On asymmetric colourings of graphs with bounded degrees and infinite motion2019-12-05Paper
On tree-decompositions of one-ended graphs
Mathematische Nachrichten
2019-05-23Paper
Non-reconstructible locally finite graphs
Journal of Combinatorial Theory. Series B
2018-10-11Paper
Clique trees of infinite locally finite chordal graphs
The Electronic Journal of Combinatorics
2018-05-25Paper
Clique trees of infinite locally finite chordal graphs
The Electronic Journal of Combinatorics
2018-05-25Paper
Breaking graph symmetries by edge colourings
Journal of Combinatorial Theory. Series B
2017-09-29Paper
A counterexample to the reconstruction conjecture for locally finite trees
Bulletin of the London Mathematical Society
2017-09-13Paper
Distinguishing graphs with intermediate growth
Combinatorica
2017-08-25Paper
A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
Discrete Applied Mathematics
2017-07-27Paper
The Cartesian product of graphs with loops
Ars Mathematica Contemporanea
2016-12-02Paper
Pursuit evasion on infinite graphs
Theoretical Computer Science
2016-11-29Paper
Extending cycles locally to Hamilton cycles
The Electronic Journal of Combinatorics
2016-05-03Paper
Fast factorization of Cartesian products of (directed) hypergraphs
Theoretical Computer Science
2016-01-21Paper
Local finiteness, distinguishing numbers, and Tucker's conjecture
The Electronic Journal of Combinatorics
2015-11-02Paper
Local finiteness, distinguishing numbers, and Tucker's conjecture
The Electronic Journal of Combinatorics
2015-11-02Paper
Distinguishing graphs with infinite motion and nonlinear growth
Ars Mathematica Contemporanea
2014-10-02Paper
Endomorphism breaking in graphs
The Electronic Journal of Combinatorics
2014-09-04Paper
Endomorphism breaking in graphs
The Electronic Journal of Combinatorics
2014-09-04Paper
On spanning tree packings of highly edge connected graphs
Journal of Combinatorial Theory. Series B
2014-08-27Paper
Random colourings and automorphism breaking in locally finite graphs
Combinatorics, Probability and Computing
2014-02-24Paper
scientific article; zbMATH DE number 1735992 (Why is no real title available?)2002-09-05Paper
Catching a robber on a random $k$-uniform hypergraph
(available as arXiv preprint)
N/APaper
Folding polyominoes into cubes
(available as arXiv preprint)
N/APaper
Self-avoiding walk is ballistic on graphs with more than one end
(available as arXiv preprint)
N/APaper
Locally finite graphs and their localization numbers
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Florian Lehner