Florian Lehner - Citegraph

Author Info

Name	Affiliation	Papers
FLORIAN LEHNER	Graz Univ Technol, Inst Geometrie, A-8010 Graz, Austria	18
Collaborators	Citations	PageRank
22	21	7.24
Referers	Referees	References
34	126	71

Search Limit

100126

Publications (18 rows)

Collaborators (22 rows)

Referers (34 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups	0	0.34	2022
Comparing Consecutive Letter Counts In Multiple Context-Free Languages	0	0.34	2021
Bounding the cop number of a graph by its genus	0	0.34	2021
A bound for the distinguishing index of regular graphs	0	0.34	2020
Hamilton decompositions of one-ended Cayley graphs	0	0.34	2020
On symmetries of edge and vertex colourings of graphs	0	0.34	2020
Clique Trees of Infinite Locally Finite Chordal Graphs.	0	0.34	2018
Non-reconstructible locally finite graphs.	0	0.34	2018
Inter-Protocol Steganography for Real-Time Services and Its Detection Using Traffic Coloring Approach	1	0.35	2017
Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number.	0	0.34	2017
Breaking graph symmetries by edge colourings.	0	0.34	2017
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs.	1	0.36	2017
The Cartesian product of graphs with loops	2	0.43	2016
Pursuit evasion on infinite graphs.	1	0.43	2016
On spanning tree packings of highly edge connected graphs	5	0.52	2014
Distinguishing graphs with infinite motion and nonlinear growth	4	0.60	2014
Endomorphism Breaking in Graphs.	6	0.79	2014
Random Colourings and Automorphism Breaking in Locally Finite Graphs.	1	0.39	2013

1