TOPICS
Search

Search Results for ""


1321 - 1330 of 2012 for Polyhedral graphSearch Results
Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...
Origami is the Japanese art of paper folding. In traditional origami, constructions are done using a single sheet of colored paper that is often, though not always, square. ...
A space-filling polyhedron is a polyhedron which can be used to generate a tessellation of space. Although even Aristotle himself proclaimed in his work On the Heavens that ...
Connectivity properties obey the following hierarchy: convex => star convex => pathwise-connected => connected.
A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...
A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...
A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.
It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...
A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.
In any tree, the number of dissimilar points minus the number of dissimilar lines plus the number of symmetry lines equals 1.
1 ... 130|131|132|133|134|135|136 ... 202 Previous Next

...