Search Results for ""

The dual polyhedron of the small cubicuboctahedron U_(13) and Wenninger dual W_(69).

The dual polyhedron of the small snub icosicosidodecahedron U_(32) and Wenninger dual W_(110).

The dual polyhedron of the small retrosnub icosicosidodecahedron and Wenninger dual W_(118).

The dual polyhedron of the small icosicosidodecahedron U_(31) and Wenninger dual W_(71).

An algorithm for computing an Egyptian fraction.

The dual polyhedron of the truncated great dodecahedron U_(37) and Wenninger dual W_(75).

The small world problem asks for the probability that two people picked at random have at least one acquaintance in common.

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

A surveying problem which asks: Determine the position of an unknown accessible point P by its bearings from three inaccessible known points A, B, and C.

Johnson solid J_(85).