Summary: We consider the problem of how the assembly process of an origami model, made up of similar pieces, can be completed given that at each step there are several choices. A result is given in the language of graphs that provides a sufficient condition under which assembly of the model will never fail.