TITLE: Cayley graph properties
QUESTION [5 upvotes]: Consider an infinite graph that satisfies the following property: if any finite set of vertices is removed (and all the adjacent edges), then the resulting graph has only one infinite connected component.
So, obviously, the Cayley graph for the group $\mathbb Z \times \mathbb Z$ w.r.t. the standard generating set is an example. Obviously, the Cayley graph for a free group is not an example.
I have a question: what is the name of such a property? Has it been studied?
And the next question: which are the Cayley graphs with this property?

REPLY [6 votes]: Quoting the answer given by YCor in the comments. 

For a graph with finite valency, it is called "one-ended graph" and it's been extensively studied (in the case of Cayley graphs, see for instance Stallings theorem). If one allows infinite valency vertices, it is sometimes called "one-ended graph" (but there's then an inequivalent alternative definition of one-ended, replacing "finite" with "bounded").