zbMATH — the first resource for mathematics

On the combinatorics of an origami model. (English) Zbl 1205.05099
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.
05C20 Directed graphs (digraphs), tournaments
52B05 Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
Full Text: DOI
[1] Frank, A.; Gyarfas, A., How to orient the edges of a graph, (), 353-364 · Zbl 0389.05035
[2] Lengvarszky, Z., Compound platonic polyhedra in origami, Mathematics magazine, 79, 3, 186-194, (2006) · Zbl 1250.05034
[3] D. Mitchell, Mathematical Origami, Tarquin, 2002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.