Search Results for ""

The great rhombicosidodecahedral graph is the Archimedean graph on 120 vertices and 180 edges that is the skeleton of the great rhombicosidodecahedron as well as the uniform ...

The Heawood four-color graph is the 25-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's ...

The Kittell graph is a planar graph on 23 nodes and 63 edges that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof of ...

The Poussin graph is the 15-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

Abstractly, a spatial configuration F is said to possess rotational symmetry if F remains invariant under the group C=C(F). Here, C(F) denotes the group of rotations of F and ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

An asymptotic direction at a point p of a regular surface M in R^3 is a direction in which the normal curvature of M vanishes. 1. There are no asymptotic directions at an ...

A polycube composed of 5 cubes. There are 29 distinct three-dimensional pentacubes (Bouwkamp 1981). Of these, the 12 planar pentacubes (corresponding to solid pentominoes), ...

The positions of the geometric centroid of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) are x^_ = ...

The rectifiable sets include the image of any Lipschitz function f from planar domains into R^3. The full set is obtained by allowing arbitrary measurable subsets of ...