A remark on Whitehead's Lemma

Abstract

We observe that Whitehead's lemma is an immediate consequence of Stallings folds.

References in corpus (1)

• On Whitehead's first free-group algorithm, cutvertices, and free-product factorizations

Cited by in corpus (3)

• A graph-theoretic proof for Whitehead's second free-group algorithm
• On Whitehead's cut vertex lemma
• A list of applications of Stallings automata