Search Results for ""

There are a number of attractive polyhedron compounds consisting of five cubes. The first of these (left figures) consists of the arrangement of five cubes in the polyhedron ...

The Königsberg bridge problem asks if the seven bridges of the city of Königsberg (left figure; Kraitchik 1942), formerly in Germany but now known as Kaliningrad and part of ...

Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...

An Archimedean spiral is a spiral with polar equation r=atheta^(1/n), (1) where r is the radial distance, theta is the polar angle, and n is a constant which determines how ...

A tree having four branches at each node. Quadtrees are used in the construction of some multidimensional databases (e.g., cartography, computer graphics, and image ...

The Klein bottle crossing number of a graph G is the minimum number of crossings possible when embedding G on a Klein bottle (cf. Garnder 1986, pp. 137-138). While the ...

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.

The Miquel configuration is the 6_4 configuration illustrated above. Its Levi graph is the rhombic dodecahedral graph.

A biflecnode, also called a biflecnodal point, is a point at which a curve crosses itself and is at the same time an inflection point. Biflecnodes are possible for curves of ...

If two complementary Plücker characteristics are equal, then each characteristic is equal to its complement except in four cases where the sum of order and class is 9.