DOIAbstract
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear growth if and only if X is a strip
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear growth if and only if X is a strip
AbstractA tessellation is taken to be an infinite, 1-ended, 3-connected, locally finite, and locally...
AbstractIn the first part of this paper we consider nilpotent groups G acting with finitely many orb...
A tessellation is understood to be a 1-ended, locally finite, locally cofinite, 3-connected planar m...
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear ...
AbstractIn this paper we give an overview on connected locally finite transitive graphs with polynom...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
If \Gamma is a planar, locally finite, vertex transitive, 1-ended graph, then there is a particular ...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
AbstractIn [4] Jung and Watkins proved that for a connected infinite graph X either κ∞(X) = ∞ holds ...
AbstractWe prove that a linear growth graph has finitely many horofunctions. This provides a short a...
Abstract. We give an example of an infinite, vertex transitive graph that has the following property...
We prove that a linear growth graph has finitely many horofunctions. This provides a short and simpl...
AbstractWe give a positive answer to a question of Thomassen and Woess; we prove that for an infinit...
AbstractWe give a positive answer to a question of Thomassen and Woess; we prove that for an infinit...
AbstractLetPbe a double ray in an infinite graphX, and letdanddPdenote the distance functions inXand...
AbstractA tessellation is taken to be an infinite, 1-ended, 3-connected, locally finite, and locally...
AbstractIn the first part of this paper we consider nilpotent groups G acting with finitely many orb...
A tessellation is understood to be a 1-ended, locally finite, locally cofinite, 3-connected planar m...
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear ...
AbstractIn this paper we give an overview on connected locally finite transitive graphs with polynom...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
If \Gamma is a planar, locally finite, vertex transitive, 1-ended graph, then there is a particular ...
AbstractLet X be a connected locally finite transitive graph with polynomial growth. We prove that g...
AbstractIn [4] Jung and Watkins proved that for a connected infinite graph X either κ∞(X) = ∞ holds ...
AbstractWe prove that a linear growth graph has finitely many horofunctions. This provides a short a...
Abstract. We give an example of an infinite, vertex transitive graph that has the following property...
We prove that a linear growth graph has finitely many horofunctions. This provides a short and simpl...
AbstractWe give a positive answer to a question of Thomassen and Woess; we prove that for an infinit...
AbstractWe give a positive answer to a question of Thomassen and Woess; we prove that for an infinit...
AbstractLetPbe a double ray in an infinite graphX, and letdanddPdenote the distance functions inXand...
AbstractA tessellation is taken to be an infinite, 1-ended, 3-connected, locally finite, and locally...
AbstractIn the first part of this paper we consider nilpotent groups G acting with finitely many orb...
A tessellation is understood to be a 1-ended, locally finite, locally cofinite, 3-connected planar m...
Add to ORKG