Search Results for ""

The hemiobelisk graph is the skeleton of the hemiobelisk. It has 7 vertices, 11 edges, and 6 faces. It is a minimal unit-distance forbidden graph. It is implemented in the ...

A point p on a regular surface M in R^3 is said to be hyperbolic if the Gaussian curvature K(p)<0 or equivalently, the principal curvatures kappa_1 and kappa_2, have opposite ...

A point p on a regular surface M in R^3 is said to be parabolic if the Gaussian curvature K(p)=0 but S(p)!=0 (where S is the shape operator), or equivalently, exactly one of ...

The pentakis icosidodecahedral graph, illustrated above, is a graph on 42 vertices that is the skeleton of the pentakis icosidodecahedron.

A straight line embedding, or "straight line drawing," of a graph is a graph embedding in which all edges are drawn as straight line segments (as opposed to curves, etc.).

A surface on which the Gaussian curvature K is everywhere positive. When K is everywhere negative, a surface is called anticlastic. A point at which the Gaussian curvature is ...

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...

The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...

The truncated pentakis dodecahedral graph, illustrated above in a pair of embeddings, is the skeleton of the truncated pentakis dodecahedron. It has 180 vertices, 270 edges, ...

Tutte's fragment (Taylor 1997) is the 15-node graph illustrated above (Grünbaum 2003, pp. 358-359 and Fig. 17.1.3). If the graph obtained by adding pendant edges to corners ...