  We generalize a theorem of Alecu, Lozin, and de Werra, proving that graph
classes with only finitely many prime graphs have bounded lettericity if and
only if they do not contain arbitrary large matchings, co-matchings, or a
family of graphs we call stacked paths.
