  We prove that a group is presented by finite convergent length-reducing
rewriting systems where each rule has left-hand side of length 3 if and only if
the group is plain. Our proof goes via a new result concerning properties of
embedded circuits in geodetic graphs, which may be of independent interest in
graph theory.
