Search Results for ""

Johnson solid J_(22).

The Fritsch graph is the 9-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 ...

In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...

Given a triangle with angles (pi/p, pi/q, pi/r), the resulting symmetry group is called a (p,q,r) triangle group (also known as a spherical tessellation). In three ...

A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...

In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...

The pentagrammic dipyramid is the dual polyhedron of the pentagrammic prism U_(78).

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

A pentagonal rotunda adjoined to a decagonal prism which is Johnson solid J_(21).

The (general) icosahedron is a 20-faced polyhedron (where icos- derives from the Greek word for "twenty" and -hedron comes from the Indo-European word for "seat"). Examples ...