Please fill in your query. A complete syntax description you will find on the General Help page.
On the combinatorics of an origami model. (English)
Discrete Math. 309, No. 12, 4171-4175 (2009).
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.
Valid XHTML 1.0 Transitional Valid CSS!