Article ID Journal Published Year Pages File Type
4649354 Discrete Mathematics 2009 5 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the combinatorics of an origami model
Authors
,