The factors X (and Y) are easily seen to be finitely generated. Stalling’s result is usually stated for groups with infinitely many ends, but a group with two ends satisfies either (a) with K of index two in X and Y or (0) with K = L = X (see [6] ). In (0) it is allowed that X = ( 1). If X (or Y) has more than one end, it can itself be factorized, and so on. If this procedure stops, G is called accessible. Using the theory due to Bass and Serre (see [2] ) of graphs of groups, an accessible group is precisely one which is the fundamcntal group of a finite graph of groups in which the edge groups are finite and the vertex groups have at most one end. C.T.C. Wall [7] conjectured that every finitely generated group is accessible. A proof of this conjecture would entail generalizing Gruschko’s Theorem (see [l] ) to free products with finite amalgamations. Let M be a right ZG-module and let Der(G,M) denote the set of all right derivations d : G + M. These are the mappings which satisfy the rule