Search Results for ""

A deltahedron is a polyhedron whose faces are congruent equilateral triangles (Wells 1986, p. 73). Note that polyhedra whose faces could be triangulated so as to be composed ...

The Errera graph is the 17-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 ...

A pyramid is a polyhedron with one face (known as the "base") a polygon and all the other faces triangles meeting at a common polygon vertex (known as the "apex"). A right ...

An equilateral triangle is a triangle with all three sides of equal length a, corresponding to what could also be known as a "regular" triangle. An equilateral triangle is ...

A general n-gonal antiprism is a polyhedron consisting of identical top and bottom n-gonal faces whose periphery is bounded by a band of 2n triangles with alternating up-down ...

Augmentation is the dual operation of truncation which replaces the faces of a polyhedron with pyramids of height h (where h may be positive, zero, or negative) having the ...

Two adjoined rotundas.

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...

A polyhedron consisting of a n-gon, a parallel 2n-gon rotated a half-edge turn, and a band of paired triangles separated by pentagons. The only true member giving a ...