Search Results for ""

A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...

A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...

The second blackboard problem in the 1997 film Good Will Hunting asks for all the series-reduced trees (referred to by the alternate term "homeomorphically irreducible trees" ...

The cube is the Platonic solid composed of six square faces that meet each other at right angles and has eight vertices and 12 edges. It is also the uniform polyhedron with ...

A convex polyhedron can be defined algebraically as the set of solutions to a system of linear inequalities mx<=b, where m is a real s×3 matrix and b is a real s-vector. ...

A number n such that the last digits of n^3 are the same as n. 49 is trimorphic since 49^3=117649 (Wells 1986, p. 124). The first few are 1, 4, 5, 6, 9, 24, 25, 49, 51, 75, ...

The cubitruncated cuboctahedron (called the cubotruncated cuboctahedron by Wenninger 1971, p. 121) is the uniform polyhedron with Maeder index 16 (Maeder 1997), Wenninger ...

The great dodecahemidodecahedron is the uniform polyhedron with Maeder index 70 (Maeder 1997), Wenninger index 107 (Wenninger 1989), Coxeter index 86 (Coxeter et al. 1954), ...

The hemicube, which might also be called the square hemiprism, is a simple solid that serves as an example of one of the two topological classes of convex hexahedron having 7 ...

When the elongated square pyramid with unit edge lengths (i.e., an equilateral obelisk) is truncated by a plane passing through opposite corners of its square base and the ...