13 citations · 13 across the 3 of their papers we have counts for
4 papers
Cutting up graphs revisited - a short proof of Stallings' structure theorem
Bernhard Krön
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs…
Green functions on self-similar graphs and bounds for the spectrum of the Laplacian
Bernhard Krön
Combining the study of the simple random walk on graphs, generating functions (especially Green functions), complex dynamics and general complex analysis we introduce a new method…
Quasi-isometries between non-locally-finite graphs and structure trees
Bernhard Krön
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of Möller in \cite{moeller92ends2} for locally finite and transiti…
End compactifications in non-locally-finite graphs
B. Krön
There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based…